| Generalized Distance Polymatrix Games
|
2024 |
Aloisio, Alessandro |
| Relaxed Agreement Forests
|
2024 |
Martinez, Virginia Ardévol |
| Fractional Bamboo Trimming and Distributed Windows Scheduling
|
2024 |
Beikmohammadi, Arash |
| Group Testing in Arbitrary Hypergraphs and Related Combinatorial Structures
|
2024 |
Bonis, Annalisa De |
| Visualization of Bipartite Graphs in Limited Window Size
|
2024 |
Evans, William |
| The Complexity of Cluster Vertex Splitting and Company
|
2024 |
Firbas, Alexander |
| Shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching
|
2024 |
Janousek, Jan |
| Combinatorics of Block-Parallel Automata Networks
|
2024 |
Perrot, Kévin |
| New Support Size Bounds and Proximity Bounds for Integer Linear Programming
|
2024 |
Berndt, Sebastian |
| On the Parameterized Complexity of Minus Domination
|
2024 |
Bhyravarapu, Sriram |
| Data Reduction for Directed Feedback Vertex Set on Graphs Without Long Induced Cycles
|
2024 |
Dirks, Jona |
| Word-Representable Graphs from a Word’s Perspective
|
2024 |
Fleischmann, Pamela |
| Removable Online Knapsack with Bounded Size Items
|
2024 |
Gourvès, Laurent |
| Faster Winner Determination Algorithms for (Colored) Arc Kayles
|
2024 |
Hanaka, Tesshu |
| Apportionment with Thresholds: Strategic Campaigns are Easy in the Top-Choice but Hard in the Second-Chance Mode
|
2024 |
Laußmann, Christian |
| Local Certification of Majority Dynamics
|
2024 |
Maldonado, Diego |
| The Weighted HOM-Problem Over Fields
|
2024 |
Nász, Andreea-Teodora |
| On the Induced Problem for Fixed-Template CSPs
|
2024 |
Takhanov, Rustem |
| Exact and Parameterized Algorithms for Choosability
|
2024 |
Bliznets, Ivan |
| Parameterized Algorithms for Covering by Arithmetic Progressions
|
2024 |
Bliznets, Ivan |
Tag hinzufügen