|
informatik.uni-trier.de
|
DBLP Page
|
|
scholar.google.com
|
Google Scholar profile
|
|
sciencedirect.com
|
Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths
|
|
sciencedirect.com
|
<font color="black">Theoretical Computer Science (2026), 37(2)</font>
|
|
people.eng.unimelb.edu.au
|
Tony Wirth
|
|
epubs.siam.org
|
A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs
|
|
epubs.siam.org
|
<font color="black">SIAM Journal on Discrete Mathematics (2023), 37(2)</font>
|
|
dl.acm.org
|
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
|
|
dl.acm.org
|
<font color="black">ACM Transactions on Algorithms (2021), 17(2)</font>
|
|
sites.google.com
|
Andreas Emil Feldmann
|
|
pasin30055.github.io
|
Pasin Manurangsi
|
|
arxiv.org
|
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)
|
|
siam.org
|
<font color="black">SIAM Journal of Computing</font>
|
|
sites.google.com
|
Andreas Emil Feldmann
|
|
cs.umd.edu
|
MohammadTaghi Hajiaghayi
|
|
cs.bme.hu
|
Dániel Marx
|
|
link.springer.com
|
A Tight Lower Bound for Planar Steiner Orientation
|
|
link.springer.com
|
<font color="black">Algorithmica (2019), 81(8), 3200-3216</font>
|
|
sites.google.com
|
Andreas Emil Feldmann
|
|
users.fit.cvut.cz
|
Ondrej Suchy
|
|
sciencedirect.com
|
Faster Exact Algorithms for Some Terminal Set Problems
|
|
sciencedirect.com
|
<font color="black">Journal of Computer and System Sciences (2017), 88, 195-207</font>
|
|
ii.uib.no
|
Fedor Fomin
|
|
ii.uib.no
|
Daniel Lokshtanov
|
|
imsc.res.in
|
Pranabendu Misra
|
|
msramanujan.weebly.com
|
M.S. Ramanujan
|
|
imsc.res.in
|
Saket Saurabh
|
|
arxiv.org
|
List H-Coloring a Graph by Removing Few Vertices
|
|
link.springer.com
|
<font color="black">Algorithmica (2017), 78(1), 110-146</font>
|
|
cs.indstate.edu
|
Laszlo Egri
|
|
cs.bme.hu
|
Dániel Marx
|
|
arxiv.org
|
Designing FPT Algorithms for Cut Problems using Randomized Contractions
|
|
epubs.siam.org
|
<font color="black">SIAM Journal of Computing (2016), 45(4), 1171-1229.</font>
|
|
mimuw.edu.pl
|
Marek Cygan
|
|
cs.umd.edu
|
MohammadTaghi Hajiaghayi
|
|
mimuw.edu.pl
|
Marcin Pilipczuk
|
|
mimuw.edu.pl
|
Michal Pilipczuk
|
|
arxiv.org
|
A Tight Algorithm for Strongly Connected Steiner Subgraph On Two Terminals With Demands
|
|
link.springer.com
|
<font color="black">Algorithmica (2017), 77(4), 1216-1239</font>
|
|
cs.umd.edu
|
Hossein Esfandiari
|
|
cs.umd.edu
|
MohammadTaghi Hajiaghayi
|
|
crab.rutgers.edu
|
Guy Kortsarz
|
|
cs.umd.edu
|
Saeed Seddighin
|
|
arxiv.org
|
Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs
|
|
sciencedirect.com
|
<font color="black">Information and Computation (2016), 247, 11-22</font>
|
|
ii.uib.no
|
Fedor Fomin
|
|
folk.uib.no
|
Petr Golovach
|
|
arxiv.org
|
Directed Subset Feedback Vertex Set is Fixed-Parameter Tractable
|
|
dl.acm.org
|
<font color="black">ACM Transactions on Algorithms (2015), 11(4), 28:1-28:28</font>
|
|
mimuw.edu.pl
|
Marek Cygan
|
|
cs.umd.edu
|
MohammadTaghi Hajiaghayi
|
|
cs.bme.hu
|
Dániel Marx
|
|
arxiv.org
|
Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset
|
|
epubs.siam.org
|
<font color="black">SIAM Journal of Computing (2013), 42(4), 1674-1696</font>
|
|
cs.umd.edu
|
MohammadTaghi Hajiaghayi
|
|
cs.bme.hu
|
Dániel Marx
|
|
arxiv.org
|
On the SIG dimension of trees under the L<sub>∞</sub> metric
|
|
link.springer.com
|
<font color="black">Graphs and Combinatorics (2013), 29(4), 773-794</font>
|
|
drona.csa.iisc.ernet.in
|
L. Sunil Chandran
|
|
link.springer.com
|
On the Exact & Approximate Complexity of Strongly Connected Steiner Subgraph On Two Terminals With Demands
|
|
fct2025.cs.uni.wroc.pl
|
<font color="black">FCT 2025</font>
|
|
arxiv.org
|
Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths
|
|
algo-conference.org
|
<font color="black">WAOA 2024</font>
|
|
people.eng.unimelb.edu.au
|
Tony Wirth
|
|
arxiv.org
|
Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs
|
|
wadscccg2023.encs.concordia.ca
|
<font color="black">WADS 2023</font>
|
|
xiugechen.github.io
|
Xiuge Chen
|
|
dblp.org
|
Patrick Eades
|
|
people.eng.unimelb.edu.au
|
Tony Wirth
|
|
aamas2023.soton.ac.uk
|
<font color="black">AAMAS 2023</font>
|
|
dblp.org
|
Sandip Banerjee
|
|
abhiruklahiri.github.io
|
Abhiruk Lahiri
|
|
arxiv.org
|
Tight Lower Bounds for Approximate & Exact k-Center in ℝ<sup>d</sup>
|
|
drops.dagstuhl.de
|
<font color="black">SoCG 2022</font>
|
|
nitinsau.github.io
|
Nitin Saurabh
|
|
proceedings.mlr.press
|
Refined Lower Bounds for Nearest Neighbor Condensation
|
|
algorithmiclearningtheory.org
|
<font color="black">ALT 2022</font>
|
|
arxiv.org
|
A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs
|
|
easyconferences.eu
|
<font color="black">CIAC 2021</font>
|
|
arxiv.org
|
Towards a Theory of Parameterized Streaming Algorithms
|
|
drops.dagstuhl.de
|
<font color="black">IPEC 2019</font>
|
|
dimacs.rutgers.edu
|
Graham Cormode
|
|
arxiv.org
|
FPT Inapproximability of Directed Cut and Connectivity Problems
|
|
drops.dagstuhl.de
|
<font color="black">IPEC 2019</font>
|
|
sites.google.com
|
Andreas Emil Feldmann
|
|
arxiv.org
|
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
|
|
drops.dagstuhl.de
|
<font color="black">ESA 2018</font>
|
|
sites.google.com
|
Andreas Emil Feldmann
|
|
pasin30055.github.io
|
Pasin Manurangsi
|
|
link.springer.com
|
A Tight Lower Bound for Steiner Orientation
|
|
link.springer.com
|
<font color="black">CSR 2018</font>
|
|
sites.google.com
|
Andreas Emil Feldmann
|
|
link.springer.com
|
Can We Create Large k-Cores by Adding Few Edges?
|
|
link.springer.com
|
<font color="black">CSR 2018</font>
|
|
elektronaj.github.io
|
Nimrod Talmon
|
|
link.springer.com
|
Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets
|
|
link.springer.com
|
<font color="black">LATIN 2018</font>
|
|
dblp.uni-trier.de
|
Sandip Banerjee
|
|
dblp.uni-trier.de
|
Sujoy Bhore
|
|
arxiv.org
|
Tight Bounds for Gomory-Hu-like Cut Counting
|
