| Communicating Finite State Machines and an Extensible Toolchain for Multiparty Session Types
|
2021 |
Yoshida, Nobuko |
| The Complexity of Bicriteria Tree-Depth
|
2021 |
Borowiecki, Piotr |
| TS-Reconfiguration of Dominating Sets in Circle and Circular-Arc Graphs
|
2021 |
Bousquet, Nicolas |
| Linear-Time Minimal Cograph Editing
|
2021 |
Crespelle, Christophe |
| Bipartite 3-Regular Counting Problems with Mixed Signs
|
2021 |
Cai, Jin-Yi |
| Regular Model Checking with Regular Relations
|
2021 |
Dave, Vrunda |
| Faster FPT Algorithms for Deletion to Pairs of Graph Classes
|
2021 |
Jacob, Ashwin |
| Deciding Top-Down Determinism of Regular Tree Languages
|
2021 |
Leupold, Peter |
| On Finding Separators in Temporal Split and Permutation Graphs
|
2021 |
Maack, Nicolas |
| On the Hardness of the Determinant: Sum of Regular Set-Multilinear Circuits
|
2021 |
Raja, S. |
| Computational Complexity of Covering Disconnected Multigraphs
|
2021 |
Bok, Jan |
| The Space Complexity of Sum Labelling
|
2021 |
Fernau, Henning |
| Mengerian Temporal Graphs Revisited
|
2021 |
Ibiapina, Allen |
| Computational Complexity of Synchronization Under Sparse Regular Constraints
|
2021 |
Hoffmann, Stefan |
| Streaming Deletion Problems Parameterized by Vertex Cover
|
2021 |
Oostveen, Jelle J. |
| Two-Sided Matching Markets with Strongly Correlated Preferences
|
2021 |
Gimbert, Hugo |
| From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization
|
2021 |
Löser,, Lukas Behrendt, Katrin Casel, Tobias Friedrich, J. A. Gregor Lagodzinski, Alexander |
| A. Poly-log Competitive Posted-Price Algorithm for Online Metrical Matching on a Spider
|
2021 |
Bender, Max |
| First-Order Logic and Its Infinitary Quantifier Extensions over Countable Words
|
2021 |
Adsul, Bharat |
| The Satisfiability Problem for a Quantitative Fragment of PCTL
|
2021 |
Chodil, Miroslav |
Tag hinzufügen