| 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 |
| Linear Algorithms for Red and Blue Domination in Convex Bipartite Graphs
|
2021 |
Abbas, Nesrine |
| Composed Degree-Distance Realizations of Graphs
|
2021 |
Bar-Noy, Amotz |
| A Hamilton Cycle in the k-Sided Pancake Network
|
2021 |
Cameron, B. |
| Covering Convex Polygons by Two Congruent Disks
|
2021 |
Choi, Jongmin |
| Algorithms and Complexity of s-Club Cluster Vertex Deletion
|
2021 |
Chakraborty, Dibyayan |
| On an Ordering Problem in Weighted Hypergraphs
|
2021 |
Damaschke, Peter |
| An Efficient Noisy Binary Search in Graphs via Median Approximation
|
2021 |
Dereniowski, Dariusz |
| A Study on the Existence of Null Labelling for 3-Hypergraphs
|
2021 |
Marco, Niccolò Di |
| Makespan Trade-Offs for Visiting Triangle Edges: (Extended Abstract)
|
2021 |
Georgiou, Konstantinos |
| Augmenting a Tree to a k-Arbor-Connected Graph with Pagenumber k
|
2021 |
Hasunuma, Toru |
| Complexity and Algorithms for MUL-Tree Pruning
|
2021 |
Gascon, Mathieu |
| Approximation Algorithms for Hitting Subgraphs
|
2021 |
Brüstle, Noah |
| Disjoint Paths and Connected Subgraphs for H-Free Graphs
|
2021 |
Kern, Walter |
Tag hinzufügen