| Publication | Date of Publication | Type |
|---|
Tight lower bounds for approximate \& exact \(k\)-center in \(\mathbb{R}^d\)
| 2024-05-14 | Paper |
Sublinear-space streaming algorithms for estimating graph parameters on sparse graphs
Lecture Notes in Computer Science | 2024-01-16 | Paper |
A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs
SIAM Journal on Discrete Mathematics | 2023-05-31 | Paper |
A tight lower bound for edge-disjoint paths on planar DAGs
| 2023-03-22 | Paper |
Towards a theory of parameterized streaming algorithms
| 2023-02-03 | Paper |
FPT Inapproximability of Directed Cut and Connectivity Problems
| 2023-02-03 | Paper |
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
ACM Transactions on Algorithms | 2022-02-16 | Paper |
Parameterized approximation algorithms for bidirected Steiner network problems
| 2021-08-04 | Paper |
Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)
SIAM Journal on Computing | 2020-03-27 | Paper |
Algorithms and hardness results for nearest neighbor problems in bicolored point sets
| 2020-02-12 | Paper |
A tight lower bound for planar Steiner orientation
Algorithmica | 2019-06-27 | Paper |
Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
| 2019-05-10 | Paper |
Can we create large \(k\)-cores by adding few edges?
| 2018-11-28 | Paper |
A tight lower bound for Steiner orientation
| 2018-11-28 | Paper |
Directed subset feedback vertex set is fixed-parameter tractable
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Parameterized Streaming: Maximal Matching and Vertex Cover
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Faster exact algorithms for some terminal set problems
Journal of Computer and System Sciences | 2017-06-30 | Paper |
List H-coloring a graph by removing few vertices
Algorithmica | 2017-05-11 | Paper |
A tight algorithm for strongly connected Steiner subgraph on two terminals with demands
Algorithmica | 2017-05-02 | Paper |
Parameterized complexity of the anchored \(k\)-core problem for directed graphs
| 2017-02-21 | Paper |
Tight Bounds for Gomory-Hu-like Cut Counting
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
Designing FPT algorithms for cut problems using randomized contractions
SIAM Journal on Computing | 2016-08-16 | Paper |
Parameterized complexity of the anchored \(k\)-core problem for directed graphs
Information and Computation | 2016-03-10 | Paper |
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract)
Parameterized and Exact Computation | 2015-09-15 | Paper |
Fixed-Parameter and Approximation Algorithms: A New Look
Parameterized and Exact Computation | 2013-12-10 | Paper |
Faster exact algorithms for some terminal set problems
Parameterized and Exact Computation | 2013-12-10 | Paper |
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
SIAM Journal on Computing | 2013-11-14 | Paper |
List H-coloring a graph by removing few vertices
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Directed Subset Feedback Vertex Set is fixed-parameter tractable
Automata, Languages, and Programming | 2013-08-12 | Paper |
On the \(SIG\)-dimension of trees under the \(L_\infty\)-metric
Graphs and Combinatorics | 2013-07-19 | Paper |
Parameterized algorithms for boxicity
Algorithms and Computation | 2010-12-09 | Paper |
