1

Synthesizing Feature Extractors: An Agentic Approach for Algorithm Selection
Proceedings of the International Conference on Automated Machine Learning, AutoML 2026, September 28 – October 1, 2026, Ljubljana, Slovenia, 2026.
Note: To appear; preprint: CoRR abs/2608.17170, https://arxiv.org/abs/2608.17170
bib Project Project Project
The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern
21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
bib Project Project
The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern
Parameterized and Exact Computation (IPEC'26) (Tuukka Korhonen, Michael Lampis, eds.), 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: To appear.
bib Project
The Graph Burning Problem under Constrained Diffusion
Advances in Optimization and Wildfire, Procedings of the First Optimization and Wildfire Conference (Filipe Alvelos, Isabel Martins, Ana Maria A. C. Rocha, eds.), pages 139–154, 2026, Springer.
PDF bib DOI
The Peculiarities of Extending Queue Layouts
Graph-Theoretic Concepts in Computer Science (WG'25) (Henning Fernau, Philipp Kindermann, eds.), volume 16124 of LNCS, pages 177–191, 2026, Springer.
bib DOI
Tractability via Low Dimensionality: The Parameterized Complexity of Training Quantized Neural Networks
The Fourteenth International Conference on Learning Representations, ICLR 2026, 2026, OpenReview.net.
Note: to appear
bib Project Project
Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms
34th International Symposium on Graph Drawing and Network Visualization, GD 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
bib Project Project
Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms
Graph Drawing and Network Visualization (GD'26) (Maarten Löffler, Silvia Miksch, eds.), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: To appear.
PDF bib Project
Using $\beta$-proximity to Reduce Distortion in Bundled Graph Drawings
EuroVis 2026 – Short Papers (Jan Byska, Alvitta Ottley, Manuela Waldner, eds.), 2026, Eurographics Association.
bib DOI
VIPR Certificate Construction from Black-Box ILP Solvers
32nd International Conference on Principles and Practice of Constraint Programming, CP 2026, July 20–23, 2026, Lisbon, Portugal, volume 379 of LIPIcs, pages 52:1–52:14, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
PDF bib Project Project DOI