| The Information Extraction Framework of Document Spanners - A Very Informal Survey
|
2024 |
Schmid, Markus L. |
| On the Computational Complexity of Generalized Common Shape Puzzles
|
2024 |
Banbara, Mutsunori |
| Row-Column Combination of Dyck Words
|
2024 |
Reghizzi, Stefano Crespi |
| On the Parameterized Complexity of the Perfect Phylogeny Problem
|
2024 |
Vlas, Jorke M. de |
| Outerplanar and Forest Storyplans
|
2024 |
Fiala, Jiri |
| The Complexity of Online Graph Games
|
2024 |
Fuchs, Janosch |
| Automata Classes Accepting Languages Whose Commutative Closure is Regular
|
2024 |
Hoffmann, Stefan |
| Algorithms and Turing Kernels for Detecting and Counting Small Patterns inUnit Disk Graphs
|
2024 |
Nederlof, Jesper |
| Complexity of Spherical Equations in Finite Groups
|
2024 |
Mattes, Caroline |
| On the Piecewise Complexity of Words and Periodic Words
|
2024 |
Praveen, M. |
| 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 |
Tag hinzufügen