| Relaxed and Approximate Graph Realizations
|
2021 |
Bar-Noy, Amotz |
| All Subgraphs of a Wheel Are 5-Coupled-Choosable
|
2021 |
Barr, Sam |
| The Pony Express Communication Problem
|
2021 |
Coleman, Jared |
| Skyline Groups Are Ideals. An Efficient Algorithm for Enumerating Skyline Groups
|
2021 |
Coumes, Simon |
| Piercing All Translates of a Set of Axis-Parallel Rectangles
|
2021 |
Dumitrescu, Adrian |
| A Triangle Process on Regular Graphs
|
2021 |
Cooper, Colin |
| Intersecting Disks Using Two Congruent Disks
|
2021 |
Kang, Byeonguk |
| Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters
|
2021 |
Kučera, Martin |
| Non-preemptive Tree Packing
|
2021 |
Lendl, Stefan |
| An FPT Algorithm for Matching Cut and d-Cut
|
2021 |
Aravind, N. R. |
| Backtrack Search for Parallelisms of Projective Spaces
|
2021 |
Topalova, Svetlana |
| Search for Combinatorial Objects Using Lattice Aigorithms – Revisited
|
2021 |
Wassermann, Alfred |
| Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
|
2021 |
Bhyravarapu, Sriram |
| Combinatorics and Algorithms for Quasi-chain Graphs
|
2021 |
Alecu, Bogdan |
| Edge Exploration of Temporal Graphs
|
2021 |
Bumpus, Benjamin Merlin |
| On the Oriented Coloring of the Disjoint Union of Graphs
|
2021 |
Coelho, Erika Morais Martins |
| Isomorphic Unordered Labeled Trees up to Substitution Ciphering
|
2021 |
Ingels, Florian |
| Card-Based Cryptographic Protocols for Three-Input Functions Using Private Operations
|
2021 |
Manabe, Yoshifumi |
| Optimal Monomial Quadratization for ODE Systems
|
2021 |
Bychkov, Andrey |
| The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets
|
2021 |
Cicalese, Ferdinando |
Tag hinzufügen