| Publication | Date of Publication | Type |
|---|
| Approximation algorithms and lower bounds for graph burning | 2025-01-14 | Paper |
The parameterized complexity of the survivable network design problem
Journal of Computer and System Sciences | 2024-12-27 | Paper |
| The parameterized complexity of the survivable network design problem | 2024-05-14 | Paper |
| scientific article; zbMATH DE number 7803596 (Why is no real title available?) | 2024-02-12 | Paper |
scientific article; zbMATH DE number 7788388 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7764108 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-13 | Paper |
| scientific article; zbMATH DE number 7759285 (Why is no real title available?) | 2023-11-02 | Paper |
Generalized \(k\)-center: distinguishing doubling and highway dimension
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
Parameterized inapproximability of independent set in \(H\)-free graphs
Algorithmica | 2023-04-11 | Paper |
| scientific article; zbMATH DE number 7651185 (Why is no real title available?) | 2023-02-07 | Paper |
FPT Inapproximability of Directed Cut and Connectivity Problems
(available as arXiv preprint) | 2023-02-03 | Paper |
Parameterized inapproximability of independent set in \(H\)-free graphs
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
Near-linear Time Approximation Schemes for Clustering in Doubling Metrics
Journal of the ACM | 2022-12-08 | Paper |
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
ACM Transactions on Algorithms | 2022-02-16 | Paper |
A note on the approximability of deepest-descent circuit steps
Operations Research Letters | 2021-12-13 | Paper |
Polynomial time approximation schemes for clustering in low highway dimension graphs
Journal of Computer and System Sciences | 2021-09-17 | Paper |
Polynomial time approximation schemes for clustering in low highway dimension graphs
Journal of Computer and System Sciences | 2021-09-17 | Paper |
Parameterized approximation algorithms for bidirected Steiner network problems
(available as arXiv preprint) | 2021-08-04 | Paper |
Travelling on graphs with small highway dimension
Algorithmica | 2021-04-19 | Paper |
Parameterized approximation schemes for Steiner trees with small number of Steiner vertices
SIAM Journal on Discrete Mathematics | 2021-03-30 | Paper |
A Note on the Approximability of Deepest-Descent Circuit Steps
(available as arXiv preprint) | 2020-10-21 | Paper |
| The parameterized hardness of the \(k\)-center problem in transportation networks | 2020-08-25 | Paper |
Parameterized approximation schemes for Steiner trees with small number of Steiner vertices
(available as arXiv preprint) | 2020-08-05 | Paper |
The parameterized hardness of the \(k\)-center problem in transportation networks
Algorithmica | 2020-05-21 | Paper |
Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)
SIAM Journal on Computing | 2020-03-27 | Paper |
Travelling on graphs with small highway dimension
Graph-Theoretic Concepts in Computer Science | 2020-02-24 | Paper |
A tight lower bound for planar Steiner orientation
Algorithmica | 2019-06-27 | Paper |
Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs
Algorithmica | 2019-03-11 | Paper |
| A tight lower bound for Steiner orientation | 2018-11-28 | Paper |
A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
SIAM Journal on Computing | 2018-09-18 | Paper |
Fast Approximation Algorithms for the Generalized Survivable Network Design Problem
(available as arXiv preprint) | 2018-04-19 | Paper |
The complexity landscape of fixed-parameter directed Steiner network problems
(available as arXiv preprint) | 2017-12-19 | Paper |
| On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree | 2017-03-22 | Paper |
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree
Mathematical Programming. Series A. Series B | 2016-11-25 | Paper |
Lehman's theorem and the directed Steiner tree problem
SIAM Journal on Discrete Mathematics | 2016-01-15 | Paper |
Fixed parameter approximations for \(k\)-center problems in low highway dimension graphs
Automata, Languages, and Programming | 2015-11-04 | Paper |
A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
Automata, Languages, and Programming | 2015-10-27 | Paper |
On the parameterized complexity of computing balanced partitions in graphs
Theory of Computing Systems | 2015-09-04 | Paper |
Balanced partitions of trees and applications
Algorithmica | 2015-05-26 | Paper |
An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs
Algorithmica | 2015-03-02 | Paper |
Improving the \(H_k\)-bound on the price of stability in undirected Shapley network design games
Theoretical Computer Science | 2014-12-02 | Paper |
Fast balanced partitioning is hard even on grids and trees
Theoretical Computer Science | 2014-01-07 | Paper |
On the parameterized complexity of computing graph bisections
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Improving the \(H _{k }\)-bound on the price of stability in undirected Shapley network design games
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Corner cuts are close to optimal: from solid grids to polygons and back
Discrete Applied Mathematics | 2013-04-25 | Paper |
Fast balanced partitioning is hard even on grids and trees
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Computing approximate Nash equilibria in network congestion games
Networks | 2012-09-21 | Paper |
| Balanced partitions of trees and applications | 2012-08-23 | Paper |
Restricted cuts for bisections in solid grids: a proof via polygons
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
An \(\mathcal{O}(n^4)\) time algorithm to compute the bisection width of solid grid graphs
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids
Combinatorial Optimization and Applications | 2011-01-08 | Paper |
Computing Approximate Nash Equilibria in Network Congestion Games
Structural Information and Communication Complexity | 2008-07-10 | Paper |
