| Recent Research Activities on Algorithmic Foundations for Social Advancement
|
2024 |
Minato, Shin-ichi |
| Reasons to Fall (More) in Love with Combinatorial Reconfiguration
|
2024 |
Nishimura, Naomi |
| Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis
|
2024 |
Yamada, Yuya |
| A Bisection Approach to Subcubic Maximum Induced Matching
|
2024 |
Hoi, Gordon |
| Stable and Dynamic Minimum Cuts
|
2024 |
Berg, Mark de |
| Counting Vanishing Matrix-Vector Products
|
2024 |
Brand, Cornelius |
| Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs
|
2024 |
Lozzo, Giordano Da |
| On the Complexity of List H-Packing for Sparse Graph Classes
|
2024 |
Gima, Tatsuya |
| Plane Multigraphs with One-Bend and Circular-Arc Edges of a Fixed Angle
|
2024 |
Tóth, Csaba D. |
| Simultaneous Drawing of Layered Trees
|
2024 |
Katheder, Julia |
| Quantum Graph Drawing
|
2024 |
Caroppo, Susanna |
| On the Hardness of Gray Code Problems for Combinatorial Objects
|
2024 |
Merino, Arturo |
| Orientable Burning Number of Graphs
|
2024 |
Courtiel, Julien |
| (t, s)-Completely Independent Spanning Trees
|
2024 |
Nakano, Shin-ichi |
| Dichotomies for Tree Minor Containment with Structural Parameters
|
2024 |
Gima, Tatsuya |
| Structural Parameterizations of Vertex Integrity
|
2024 |
Gima, Tatsuya |
| The Parameterized Complexity of Terminal Monitoring Set
|
2024 |
Aravind, N. R. |
| Fully Dynamic Algorithms for Euclidean Steiner Tree
|
2024 |
Chan, T.-H. Hubert |
| Generating Cyclic 2-Gray Codes for Fibonacci q-Decreasing Words
|
2024 |
Wong, Dennis |
| On MAX–SAT with Cardinality Constraint
|
2024 |
Panolan, Fahad |
Tag hinzufügen