| Beyond the BEST Theorem: Fast Assessment of Eulerian Trails
|
2021 |
Conte, Alessio |
| Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes
|
2021 |
Eppstein, David |
| On Dasgupta’s Hierarchical Clustering Objective and Its Relation to Other Graph Parameters
|
2021 |
Hogemo, Svein |
| Fast Algorithms for the Rooted Triplet Distance Between Caterpillars
|
2021 |
Jansson, Jesper |
| Propositional Gossip Protocols
|
2021 |
Livesey, Joseph |
| Complexity of Word Problems for HNN-Extensions
|
2021 |
Lohrey, Markus |
| Valency-Based Consensus Under Message Adversaries Without Limit-Closure
|
2021 |
Winkler, Kyrill |
| 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 |
Tag hinzufügen