Recent Publications
Journals (with refereeing)
Conference Proceedings (with selection process)
-
N. El Maalouly.
Exact Matching: Algorithms and Related Problems (arXiv).
40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023), to appear.
-
M. Ghaffari, C. Grunau, B. Haeupler, S. Ilchi, V. Rozhoň.
Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization (arXiv).
42th Symposium on Discrete Algorithms (SODA 2023), to appear.
Other
Submitted
-
K. Bérczi, H. Hoang, L. Tóthmérész.
On approximating the rank of graph divisors (arXiv).
Submitted (2022).
-
D. Bertschinger, C. Hertrich, P. Jungeblut, T. Miltzow, S. Weber.
Training Fully Connected Neural Networks is ∃R-Complete (arXiv).
Submitted (2022).
-
S. Bhyravarapu, T. A. Hartmann, H. Hoang, S. Kalyanasundaram, I. V. Reddy.
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs (arXiv).
Submitted (2022).
-
M. Borzechowski, J. Doolittle, S. Weber.
A Universal Construction for Unique Sink Orientations (arXiv).
Submitted (2022).
-
N. El Maalouly, R. Steiner, L. Wulf.
Exact Matching: Correct Parity and FPT Parameterized by Independence Number (arXiv).
Submitted (2022).
-
Yuan Gao, B. Gärtner, Jourdain Lamperski.
A New Combinatorial Property of Geometric Unique Sink Orientations (arXiv).
Submitted (2020).
-
H. Hoang, S. Lendl, L. Wulf.
Assistance and Interdiction Problems on Interval Graphs.
Submitted (2021).
-
A. Mohammadi, Th. Pham, Y. Wang.
An energy decomposition theorem for matrices and related questions (arXiv).
Submitted.
-
P. Schnider.
Equipartitions with Wedges and Cones (arXiv).
Submitted (2019).
-
S. Weber, B. Gärtner.
A Characterization of the Realizable Matoušek Unique Sink Orientations (arXiv).
Submitted (2021).
-
S. Weber, J. Widmer.
Realizability Makes a Difference: A Complexity Gap for Sink-Finding in USOs (arXiv).
Submitted (2022).
