Saket Saurabh

ACM Trans. Algorithms, April, 2024

Diverse collections in matroids and graphs.

[BibT_eX]

[DOI]

Math. Program., March, 2024

The Parameterized Complexity of Guarding Almost Convex Polygons.

[BibT_eX]

[DOI]

Kristine V. K. Knudsen

Discret. Comput. Geom., March, 2024

Partitioning subclasses of chordal graphs with few deletions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., February, 2024

Parameterized approximation algorithms for weighted vertex cover.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2024

Maximum Partial List H-Coloring on P5-free graphs in polynomial time.

[BibT_eX]

[DOI]

CoRR, 2024

Parameterized Approximation for Capacitated d-Hitting Set with Hard Capacities.

[BibT_eX]

[DOI]

Jie Xue

CoRR, 2024

Parameterized Saga of First-Fit and Last-Fit Coloring.

[BibT_eX]

[DOI]

CoRR, 2024

Packing Short Cycles.

[BibT_eX]

[DOI]

CoRR, 2024

Fixed-Parameter Tractability of Hedge Cut.

[BibT_eX]

[DOI]

CoRR, 2024

Subexponential Parameterized Algorithms for Hitting Subgraphs.

[BibT_eX]

[DOI]

CoRR, 2024

Conflict and Fairness in Resource Allocation.

[BibT_eX]

[DOI]

CoRR, 2024

Odd Cycle Transversal on P5-free Graphs in Polynomial Time.

[BibT_eX]

[DOI]

CoRR, 2024

Stability in Graphs with Matroid Constraints.

[BibT_eX]

[DOI]

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Eliminating Crossings in Ordered Graphs.

[BibT_eX]

[DOI]

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

On the Parameterized Complexity of Minus Domination.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Meta-theorems for Parameterized Streaming Algorithms‡.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Odd Cycle Transversal on P5-free Graphs in Quasi-polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Breaking a Graph into Connected Components with Small Dominating Sets.

[BibT_eX]

[DOI]

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset.

[BibT_eX]

[DOI]

Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

The Parameterized Complexity Landscape of Two-Sets Cut-Uncut.

[BibT_eX]

[DOI]

Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

Parameterized Complexity of Paired Domination.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

Kernelization of Counting Problems.

[BibT_eX]

[DOI]

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Exponential-Time Approximation Schemes via Compression.

[BibT_eX]

[DOI]

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints.

[BibT_eX]

[DOI]

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

When Far Is Better: The Chamberlin-Courant Approach to Obnoxious Committee Selection.

[BibT_eX]

[DOI]

Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

Efficient Approximation of Fractional Hypertree Width.

[BibT_eX]

[DOI]

Viktoriia Korchemna

Jie Xue

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Cuts in Graphs with Matroid Constraints.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Discovering Bayesian Networks when Few Variables Matter.

[BibT_eX]

[DOI]

Madhumita Kundu

Pekka Parviainen

Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2024

Hybrid k-Clustering: Blending k-Median and k-Center.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2024

Fair Soft Clustering.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023

Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems.

[BibT_eX]

[DOI]

Sanjukta Roy

SIAM J. Discret. Math., December, 2023

Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams.

[BibT_eX]

[DOI]

Theory Comput. Syst., December, 2023

Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules.

[BibT_eX]

[DOI]

Algorithmica, December, 2023

Detours in directed graphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., November, 2023

Almost optimal query algorithm for hitting set using a subset query.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., November, 2023

Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number.

[BibT_eX]

[DOI]

Algorithmica, July, 2023

Polynomial Kernel for Interval Vertex Deletion.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, April, 2023

Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., April, 2023

Erdős-Pósa property of obstructions to interval graphs.

[BibT_eX]

[DOI]

J. Graph Theory, April, 2023

On the optimality of pseudo-polynomial algorithms for integer programming.

[BibT_eX]

[DOI]

Math. Program., March, 2023

Parameterized algorithms for finding highly connected solution.

[BibT_eX]

[DOI]

Ankit Abhinav

Aritra Banik

Theor. Comput. Sci., 2023

Parameterized complexity of multi-node hubs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2023

Clustering what Matters: Optimal Approximation for Clustering with Outliers.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2023

How to assign volunteers to tasks compatibly ? A graph theoretic and parameterized approach.

[BibT_eX]

[DOI]

Pallavi Jain

CoRR, 2023

Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs.

[BibT_eX]

[DOI]

CoRR, 2023

An Improved Exact Algorithm for Knot-Free Vertex Deletion.

[BibT_eX]

[DOI]

CoRR, 2023

An ETH-Tight Algorithm for Bidirected Steiner Connectivity.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Balanced Substructures in Bicolored Graphs.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

A Framework for Approximation Schemes on Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Parameterized Approximation Scheme for Feedback Vertex Set.

[BibT_eX]

[DOI]

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Fixed-Parameter Algorithms for Fair Hitting Set Problems.

[BibT_eX]

[DOI]

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity.

[BibT_eX]

[DOI]

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Parameterized Algorithms for Eccentricity Shortest Path Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

Burn and Win.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

On the Complexity of the Eigenvalue Deletion Problem.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Breaking the All Subsets Barrier for Min k-Cut.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less.

[BibT_eX]

[DOI]

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

Lossy Kernelization for (Implicit) Hitting Set Problems.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Kernelization for Spreading Points.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability).

[BibT_eX]

[DOI]

Tanmay Inamdar

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii.

[BibT_eX]

[DOI]

Sayan Bandyapadhyay

William Lochet

Proceedings of the 39th International Symposium on Computational Geometry, 2023

Minimum-Membership Geometric Set Cover, Revisited.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

Resolute control: Forbidding candidates from winning an election is hard.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

On the complexity of singly connected vertex deletion.

[BibT_eX]

[DOI]

Avinandan Das

Komal Muluk

Nidhi Purohit

Theor. Comput. Sci., 2022

On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization).

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering.

[BibT_eX]

[DOI]

SIAM J. Comput., 2022

Exact Multi-Covering Problems with Geometric Sets.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2022

On the parameterized complexity of Grid Contraction.

[BibT_eX]

[DOI]

Uéverton dos Santos Souza

J. Comput. Syst. Sci., 2022

Highly unbreakable graph with a fixed excluded minor are almost rigid.

[BibT_eX]

[DOI]

CoRR, 2022

Parameterized Algorithms for Locally Minimal Defensive Alliance.

[BibT_eX]

[DOI]

Ajinkya Gaikwad

Soumen Maity

CoRR, 2022

Maximum Minimal Feedback Vertex Set: A Parameterized Perspective.

[BibT_eX]

[DOI]

CoRR, 2022

Parameterized Complexity of Graph Partitioning into Connected Clusters.

[BibT_eX]

[DOI]

Ankit Abhinav

Aritra Banik

CoRR, 2022

Theory research in India: 2019-2022.

[BibT_eX]

[DOI]

C. Aiswarya

Vikraman Arvind

Commun. ACM, 2022

On the Parameterized Complexity of Maximum Degree Contraction Problem.

[BibT_eX]

[DOI]

Algorithmica, 2022

Parameterized Complexity of Directed Spanner Problems.

[BibT_eX]

[DOI]

Algorithmica, 2022

A Polynomial Kernel for Bipartite Permutation Vertex Deletion.

[BibT_eX]

[DOI]

Jan Derbisz

Shaily Verma

Algorithmica, 2022

Fast Exact Algorithms for Survivable Network Design with Uniform Requirements.

[BibT_eX]

[DOI]

Algorithmica, 2022

Parameterized Complexity of Maximum Edge Colorable Subgraph.

[BibT_eX]

[DOI]

Algorithmica, 2022

Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor.

[BibT_eX]

[DOI]

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems.

[BibT_eX]

[DOI]

Sanjukta Roy

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Gehrlein Stable Committee with Multi-modal Preferences.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

An Exact Algorithm for Knot-Free Vertex Deletion.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets.

[BibT_eX]

[DOI]

Ankit Abhinav

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

List Homomorphism: Beyond the Known Boundaries.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

Exact Exponential Algorithms for Clustering Problems.

[BibT_eX]

[DOI]

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

A Finite Algorithm for the Realizabilty of a Delaunay Triangulation.

[BibT_eX]

[DOI]

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

Parameterized Analysis for the Group Activity Selection Problem on Graphs.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2022

Output Sensitive Fault Tolerant Maximum Matching.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2022

Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

On the Parameterized Approximability of Contraction to Classes of Chordal Graphs.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2021

Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2021

Multiplicative Parameterization Above a Guarantee.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2021

Parameterized complexity of fair feedback vertex set problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Balanced stable marriage: How close is close enough?

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Paths to trees and cacti.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

2-Approximating Feedback Vertex Set in Tournaments.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

Approximate Counting of k-Paths: Simpler, Deterministic, and in Polynomial Space.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

Randomized Contractions Meet Lean Decompositions.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs.

[BibT_eX]

[DOI]

J. Comput. Geom., 2021

Parameterized and exact algorithms for class domination coloring.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Space-Efficient FPT Algorithms.

[BibT_eX]

[DOI]

CoRR, 2021

α-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms.

[BibT_eX]

[DOI]

CoRR, 2021

Elimination Distance to Topological-minor-free Graphs is FPT.

[BibT_eX]

[DOI]

CoRR, 2021

Approximation in (Poly-) Logarithmic Space.

[BibT_eX]

[DOI]

Arindam Biswas

Algorithmica, 2021

Packing Arc-Disjoint Cycles in Tournaments.

[BibT_eX]

[DOI]

Algorithmica, 2021

Simultaneous Feedback Edge Set: A Parameterized Perspective.

[BibT_eX]

[DOI]

Algorithmica, 2021

Odd Cycle Transversal in Mixed Graphs.

[BibT_eX]

[DOI]

Avinandan Das

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Exploiting Dense Structures in Parameterized Complexity.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

An FPT Algorithm for Elimination Distance to Bounded Degree Graphs.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version).

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

FPT-approximation for FPT Problems.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Strong Connectivity Augmentation is FPT.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

A Polynomial Kernel for Bipartite Permutation Vertex Deletion.

[BibT_eX]

[DOI]

Shaily Verma

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

A Polynomial Kernel for Deletion to Ptolemaic Graphs.

[BibT_eX]

[DOI]

Aditya Anand

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

An ETH-Tight Algorithm for Multi-Team Formation.

[BibT_eX]

[DOI]

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space.

[BibT_eX]

[DOI]

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

k-Distinct Branchings Admits a Polynomial Kernel.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Circumventing Connectivity for Kernelization.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

Linear representation of transversal matroids and gammoids parameterized by rank.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Fixed-parameter tractable algorithms for Tracking Shortest Paths.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Fully dynamic arboricity maintenance.

[BibT_eX]

[DOI]

Niranka Banerjee

Theor. Comput. Sci., 2020

Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

Approximation Schemes for Low-rank Binary Matrix Approximation Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

Going Far from Degeneracy.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Path Contraction Faster than 2n.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Bidimensionality and Kernels.

[BibT_eX]

[DOI]

SIAM J. Comput., 2020

Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Subexponential algorithm for d-cluster edge deletion: Exception or rule?

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

Faster Graph bipartization.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

A characterization of König-Egerváry graphs with extendable vertex covers.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

Popular Matching in Roommates Setting is NP-hard.

[BibT_eX]

[DOI]

Bull. EATCS, 2020

On the Parameterized Complexity of \textsc{Maximum Degree Contraction} Problem.

[BibT_eX]

[DOI]

CoRR, 2020

Approximation algorithms for geometric conflict free covering problems.

[BibT_eX]

[DOI]

Aritra Banik

Vibha Sahlot

Comput. Geom., 2020

On the Approximate Compressibility of Connected Vertex Cover.

[BibT_eX]

[DOI]

Diptapriyo Majumdar

Algorithmica, 2020

Quadratic Vertex Kernel for Rainbow Matching.

[BibT_eX]

[DOI]

Algorithmica, 2020

Parameterized Complexity of Geometric Covering Problems Having Conflicts.

[BibT_eX]

[DOI]

Algorithmica, 2020

A Polynomial Sized Kernel for Tracking Paths Problem.

[BibT_eX]

[DOI]

Algorithmica, 2020

Parameterized Complexity of Conflict-Free Matchings and Paths.

[BibT_eX]

[DOI]

Algorithmica, 2020

Gehrlein stability in committee selection: parameterized hardness and algorithms.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2020

An exponential time parameterized algorithm for planar disjoint paths.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Hitting topological minors is FPT.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Parameterized Complexity and Approximability of Directed Odd Cycle Transversal.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

On the Parameterized Complexity of Deletion to ℋ-Free Strong Components.

[BibT_eX]

[DOI]

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Quick Separation in Chordal and Split Graphs.

[BibT_eX]

[DOI]

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Graph Hamiltonicity Parameterized by Proper Interval Deletion Set.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

A Polynomial Kernel for Paw-Free Editing.

[BibT_eX]

[DOI]

Eduard Eiben

William Lochet

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

Fault Tolerant Subgraphs with Applications in Kernelization.

[BibT_eX]

[DOI]

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Parameterization Above a Multiplicative Guarantee.

[BibT_eX]

[DOI]

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Well-Structured Committees.

[BibT_eX]

[DOI]

Pallavi Jain

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion.

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

On the (Parameterized) Complexity of Almost Stable Marriage.

[BibT_eX]

[DOI]

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Parameterized Complexity of Feedback Vertex Sets on Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Optimal Output Sensitive Fault Tolerant Cuts.

[BibT_eX]

[DOI]

Niranka Banerjee

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

A Parameterized Approximation Scheme for Min $k$-Cut.

[BibT_eX]

[DOI]

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Fixed Parameter Tractability of Graph Deletion Problems over Data Streams.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths.

[BibT_eX]

[DOI]

Proceedings of the Treewidth, Kernels, and Algorithms, 2020

Parameterized Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Beyond the Worst-Case Analysis of Algorithms, 2020

2019

Communication Complexity and Graph Families.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2019

Split Contraction: The Untold Story.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2019

The parameterized complexity landscape of finding 2-partitions of digraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Spanning Circuits in Regular Matroids.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Rank Vertex Cover as a Natural Problem for Algebraic Compression.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Balanced Judicious Bipartition is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Packing Cycles Faster Than Erdos-Posa.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Editing to Connected F-Degree Graph.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Minimum Bisection Is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

On the Parameterized Complexity of Contraction to Generalization of Trees.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2019

Exact Algorithms via Monotone Local Search.

[BibT_eX]

[DOI]

J. ACM, 2019

Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2019

New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2019

FPT Algorithms for Conflict-free Coloring of Graphs and Chromatic Terrain Guarding.

[BibT_eX]

[DOI]

CoRR, 2019

A Brief Note on Single Source Fault Tolerant Reachability.

[BibT_eX]

[DOI]

CoRR, 2019

Reducing Topological Minor Containment to the Unique Linkage Theorem.

[BibT_eX]

[DOI]

CoRR, 2019

Subset Feedback Vertex Set in Chordal and Split Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2019

Parameterized Algorithms for List K-Cycle.

[BibT_eX]

[DOI]

Algorithmica, 2019

Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2019

The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue.

[BibT_eX]

[DOI]

Algorithmica, 2019

Parameterized Algorithms and Kernels for Rainbow Matching.

[BibT_eX]

[DOI]

Algorithmica, 2019

Stability in barter exchange markets.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2019

Parameterized Computational Geometry via Decomposition Theorems.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Interval Vertex Deletion Admits a Polynomial Kernel.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Solving Group Interval Scheduling Efficiently.

[BibT_eX]

[DOI]

Arindam Biswas

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

On Succinct Encodings for the Tournament Fixing Problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Decomposition of Map Graphs with Applications.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Approximate Counting of k-Paths: Deterministic and in Polynomial Space.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Parameterized Streaming Algorithms for Min-Ones d-SAT.

[BibT_eX]

[DOI]

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Exact and Approximate Digraph Bandwidth.

[BibT_eX]

[DOI]

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

On the Parameterized Complexity of Edge-Linked Paths.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2019

On the Complexity of Mixed Dominating Set.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2019

Connecting the Dots (with Minimum Crossings).

[BibT_eX]

[DOI]

Grzegorz Guspiel

Proceedings of the 35th International Symposium on Computational Geometry, 2019

An Erdős-Pósa Theorem on Neighborhoods and Domination Number.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018

Simultaneous Feedback Vertex Set: A Parameterized Perspective.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2018

Bivariate complexity analysis of Almost Forest Deletion.

[BibT_eX]

[DOI]

Ashutosh Rai

Theor. Comput. Sci., 2018

On the kernelization complexity of string problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Parameterized algorithms for stable matching with ties and incomplete lists.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Linear Time Parameterized Algorithms for Subset Feedback Vertex Set.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal.

[BibT_eX]

[DOI]

Dániel Marx

ACM Trans. Algorithms, 2018

Deterministic Truncation of Linear Matroids.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue.

[BibT_eX]

[DOI]

Aravindan Vijayaraghavan

Qin Zhang

ACM Trans. Algorithms, 2018

Exact Algorithms for Terrain Guarding.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel.

[BibT_eX]

[DOI]

Geevarghese Philip

Ashutosh Rai

SIAM J. Discret. Math., 2018

Below All Subsets for Minimal Connected Dominating Set.

[BibT_eX]

[DOI]

Michal Pilipczuk

SIAM J. Discret. Math., 2018

Matrix Rigidity from the Viewpoint of Parameterized Complexity.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Covering Vectors by Spaces: Regular Matroids.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Kernelization of Cycle Packing with Relaxed Disjointness Constraints.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Slightly Superexponential Parameterized Problems.

[BibT_eX]

[DOI]

Dániel Marx

SIAM J. Comput., 2018

Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators.

[BibT_eX]

[DOI]

Diptapriyo Majumdar

Theory Comput. Syst., 2018

Parameterised Algorithms for Deletion to Classes of DAGs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

Reconfiguration on sparse graphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

Finding even subgraphs even faster.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

Kernels for deletion to classes of acyclic digraphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes.

[BibT_eX]

[DOI]

J. ACM, 2018

Long directed (s, t)-path: FPT algorithm.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

Randomized contractions meet lean decompositions.

[BibT_eX]

[DOI]

CoRR, 2018

A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments.

[BibT_eX]

[DOI]

CoRR, 2018

The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments.

[BibT_eX]

[DOI]

CoRR, 2018

$$(k, n-k)$$ ( k , n - k ) -Max-Cut: An $$\mathcal{O}^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial Kernel.

[BibT_eX]

[DOI]

Algorithmica, 2018

Rank Reduction of Oriented Graphs by Vertex and Edge Deletions.

[BibT_eX]

[DOI]

Syed Mohammad Meesum

Algorithmica, 2018

Preface to Special Issue Dedicated to the 60th Birthday of Gregory Gutin.

[BibT_eX]

[DOI]

Algorithmica, 2018

When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Parameterized Algorithms for Survivable Network Design with Uniform Demands.

[BibT_eX]

[DOI]

Manu Basavaraju

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Conflict Free Feedback Vertex Set: A Parameterized Dichotomy.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem.

[BibT_eX]

[DOI]

Mateus de Oliveira Oliveira

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

Exploring the Kernelization Borders for Hitting Cycles.

[BibT_eX]

[DOI]

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity.

[BibT_eX]

[DOI]

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Winning a Tournament by Any Means Necessary.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

When Rigging a Tournament, Let Greediness Blind You.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Reducing CMSO Model Checking to Highly Connected Graphs.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

A parameterized runtime analysis of randomized local search and evolutionary algorithm for max l-uncut.

[BibT_eX]

[DOI]

Pallavi Jain

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

Max-Cut Above Spanning Tree is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2018

Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces.

[BibT_eX]

[DOI]

Anastasios Sidiropoulos

Proceedings of the 34th International Symposium on Computational Geometry, 2018

Hitting and Covering Partially.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

On approximability of optimization problems related to Red/Blue-split graphs.

[BibT_eX]

[DOI]

Sounaka Mishra

Shijin Rajakrishnan

Theor. Comput. Sci., 2017

Parameterized complexity of Strip Packing and Minimum Volume Packing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2017

Uniform Kernelization Complexity of Hitting Forbidden Minors.

[BibT_eX]

[DOI]

Bart M. P. Jansen

ACM Trans. Algorithms, 2017

Representative Families of Product Families.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2017

Hitting Selected (Odd) Cycles.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Parameterized Complexity of Directed Steiner Tree on Sparse Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth.

[BibT_eX]

[DOI]

SIAM J. Comput., 2017

Irrelevant vertices for the planar Disjoint Paths Problem.

[BibT_eX]

[DOI]

Isolde Adler

Stavros G. Kolliopoulos

Philipp Klaus Krause

J. Comb. Theory B, 2017

On the parameterized complexity of b-chromatic number.

[BibT_eX]

[DOI]

Geevarghese Philip

J. Comput. Syst. Sci., 2017

Faster exact algorithms for some terminal set problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

Balanced Judicious Partition is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

CoRR, 2017

The Half-integral Erdös-Pósa Property for Non-null Cycles.

[BibT_eX]

[DOI]

CoRR, 2017

On Treewidth and Stable Marriage.

[BibT_eX]

[DOI]

CoRR, 2017

On finding highly connected spanning subgraphs.

[BibT_eX]

[DOI]

CoRR, 2017

Polylogarithmic Approximation Algorithms for Weighted-$\mathcal{F}$-Deletion Problems.

[BibT_eX]

[DOI]

CoRR, 2017

Quick but Odd Growth of Cacti.

[BibT_eX]

[DOI]

Algorithmica, 2017

Parameterized Complexity of Superstring Problems.

[BibT_eX]

[DOI]

Algorithmica, 2017

Multivariate Complexity Analysis of Geometric Red Blue Set Cover.

[BibT_eX]

[DOI]

Pradeesha Ashok

Algorithmica, 2017

Lossy kernelization.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Group Activity Selection on Graphs: Parameterized Analysis.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

Communication Complexity of Pairs of Graph Families with Applications.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

A Linear-Time Parameterized Algorithm for Node Unique Label Cover.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Matroids in Parameterized Complexity and Exact Algorithms.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Reducing rank of the adjacency matrix by graph modification.

[BibT_eX]

[DOI]

Syed Mohammad Meesum

Theor. Comput. Sci., 2016

On Problems as Hard as CNF-SAT.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Tree Deletion Set Has a Polynomial Kernel but No OPTO(1) Approximation.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Hitting Forbidden Minors: Approximation and Kernelization.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Partially Polynomial Kernels for Set Cover and Test Cover.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms.

[BibT_eX]

[DOI]

J. ACM, 2016

(Meta) Kernelization.

[BibT_eX]

[DOI]

J. ACM, 2016

A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set.

[BibT_eX]

[DOI]

CoRR, 2016

Fine-grained complexity of integer programming: The case of bounded branch-width and rank.

[BibT_eX]

[DOI]

CoRR, 2016

Backdoors to q-Horn.

[BibT_eX]

[DOI]

Algorithmica, 2016

Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs.

[BibT_eX]

[DOI]

Sven Simonsen

Algorithmica, 2016

Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments.

[BibT_eX]

[DOI]

Alessandro Maddaloni

Fernando Sánchez Villaamil

Algorithmica, 2016

Lower Bounds for Approximation Schemes for Closest String.

[BibT_eX]

[DOI]

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Kernelization and Sparseness: the Case of Dominating Set.

[BibT_eX]

[DOI]

Pål Grønås Drange

Markus Sortland Dregi

Sebastian Siebertz

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

(k, n-k)-Max-Cut: An 𝒪∗(2p)-Time Algorithm and a Polynomial Kernel.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Rank Reduction of Directed Graphs by Vertex and Edge Deletions.

[BibT_eX]

[DOI]

Syed Mohammad Meesum

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Parameterized Complexity of Red Blue Set Cover for Lines.

[BibT_eX]

[DOI]

Pradeesha Ashok

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

A Parameterized Algorithm for Mixed-Cut.

[BibT_eX]

[DOI]

Ashutosh Rai

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set.

[BibT_eX]

[DOI]

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

Kernelizing Buttons and Scissors.

[BibT_eX]

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

On the parameterized complexity of vertex cover and edge cover with connectivity constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Multivariate Complexity Analysis of Geometric {\sc Red Blue Set Cover}.

[BibT_eX]

[DOI]

Pradeesha Ashok

CoRR, 2015

On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Solving d-SAT via Backdoors to Small Treewidth.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

B-Chromatic Number: Beyond NP-Hardness.

[BibT_eX]

[DOI]

Geevarghese Philip

Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators.

[BibT_eX]

[DOI]

Diptapriyo Majumdar

Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

FO Model Checking on Posets of Bounded Width.

[BibT_eX]

[DOI]

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Graph Modification Problems: A Modern Perspective.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs.

[BibT_eX]

[DOI]

Niranka Banerjee

Sankardeep Chakraborty

Sasanka Roy

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

Unique Covering Problems with Geometric Sets.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

Parameterized Algorithms

[BibT_eX]

[DOI]

Springer, ISBN: 978-3-319-21275-3, 2015

2014

Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Faster Parameterized Algorithms Using Linear Programming.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2014

Kernelization Lower Bounds Through Colors and IDs.

[BibT_eX]

[DOI]

Michael Dom

Fernando Sánchez Villaamil

ACM Trans. Algorithms, 2014

Hitting and Harvesting Pumpkins.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width.

[BibT_eX]

[DOI]

SIAM J. Comput., 2014

On the Hardness of Losing Width.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzík bound.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2014

Kernelization and Sparseness: the case of Dominating Set.

[BibT_eX]

[DOI]

CoRR, 2014

The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles.

[BibT_eX]

[DOI]

Algorithmica, 2014

On Cutwidth Parameterized by Vertex Cover.

[BibT_eX]

[DOI]

Algorithmica, 2014

Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables.

[BibT_eX]

[DOI]

Algorithmica, 2014

A Near-Optimal Planarization Algorithm.

[BibT_eX]

[DOI]

Bart M. P. Jansen

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Parameterized Approximations via d-Skew-Symmetric Multicut.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Parameterized Algorithms to Preserve Connectivity.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation).

[BibT_eX]

[DOI]

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Connecting Vertices by Independent Trees.

[BibT_eX]

[DOI]

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Solving Multicut Faster Than 2 n.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2014, 2014

Representative Sets of Product Families.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2014, 2014

Kernelization Methods for Fixed-Parameter Tractability.

[BibT_eX]

[DOI]

Proceedings of the Tractability: Practical Approaches to Hard Problems, 2014

2013

Distortion is Fixed Parameter Tractable.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2013

Parameterized complexity of MaxSat Above Average.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

A Polynomial Kernel for Proper Interval Vertex Deletion.

[BibT_eX]

[DOI]

Yngve Villanger

SIAM J. Discret. Math., 2013

A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

An FPT algorithm for Tree Deletion Set.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2013

A linear vertex kernel for maximum internal spanning tree.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2013

Imbalance is fixed parameter tractable.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization.

[BibT_eX]

[DOI]

Inf. Comput., 2013

Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs.

[BibT_eX]

[DOI]

Inf. Comput., 2013

Polynomial Kernels for λ-extendible Properties Parameterized Above the Poljak-Turzík Bound.

[BibT_eX]

[DOI]

CoRR, 2013

Guest Editorial: Special Issue on Parameterized and Exact Computation, Part II.

[BibT_eX]

[DOI]

Algorithmica, 2013

The Parameterized Complexity of Unique Coverage and Its Variants.

[BibT_eX]

[DOI]

Algorithmica, 2013

Computing Optimal Steiner Trees in Polynomial Space.

[BibT_eX]

[DOI]

Algorithmica, 2013

Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Hardness of r-dominating set on Graphs of Diameter (r + 1).

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012

On Parameterized Independent Feedback Vertex Set.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Kernel(s) for problems with no kernel: On out-trees with many leaves.

[BibT_eX]

[DOI]

Daniel Binkele-Raible

ACM Trans. Algorithms, 2012

Maximum r-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

Counting Subgraphs via Homomorphisms.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

Parameterized complexity of finding small degree-constrained subgraphs.

[BibT_eX]

[DOI]

Ignasi Sau

J. Discrete Algorithms, 2012

Faster algorithms for finding and counting subgraphs.

[BibT_eX]

[DOI]

B. V. Raghavendra Rao

J. Comput. Syst. Sci., 2012

Local search: Is brute-force avoidable?

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

FPT algorithms for Connected Feedback Vertex Set.

[BibT_eX]

[DOI]

J. Comb. Optim., 2012

On the approximability of some degree-constrained subgraph problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Data Reduction and Problem Kernels (Dagstuhl Seminar 12241).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2012

Planar F-Deletion: Approximation and Optimal FPT Algorithms

[BibT_eX]

[DOI]

CoRR, 2012

Guest Editorial: Special Issue on Parameterized and Exact Computation, Part I.

[BibT_eX]

[DOI]

Algorithmica, 2012

Sharp Separation and Applications to Exact and Parameterized Algorithms.

[BibT_eX]

[DOI]

Algorithmica, 2012

Parameterized Algorithms for Even Cycle Transversal.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

LP can be a cure for Parameterized Problems.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Linear kernels for (connected) dominating set on H-minor-free graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Bidimensionality and geometric graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Parameterized Study of the Test Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

Subexponential Parameterized Odd Cycle Transversal on Planar Graphs.

[BibT_eX]

[DOI]

Magnus Wahlström

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

Kernelization - Preprocessing with a Guarantee.

[BibT_eX]

[DOI]

Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

Don't Be Strict in Local Search!

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

A linear kernel for planar connected dominating set.

[BibT_eX]

[DOI]

Matthias Mnich

Theor. Comput. Sci., 2011

Bandwidth on AT-free graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

An exact algorithm for minimum distortion embedding.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Strengthening Erdös-Pósa property for minor-closed graph classes.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Kernels for feedback arc set in tournaments.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2011

Implicit branching and parameterized partial cover problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2011

Subexponential algorithms for partial cover problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

On the complexity of some colorful problems parameterized by treewidth.

[BibT_eX]

[DOI]

Inf. Comput., 2011

Lower bounds based on the Exponential Time Hypothesis.

[BibT_eX]

[DOI]

Dániel Marx

Bull. EATCS, 2011

Lower bounds on kernelization.

[BibT_eX]

[DOI]

Discret. Optim., 2011

On the directed Full Degree Spanning Tree problem.

[BibT_eX]

[DOI]

Discret. Optim., 2011

On Problems as Hard as CNFSAT

[BibT_eX]

[DOI]

CoRR, 2011

The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover.

[BibT_eX]

[DOI]

Algorithmica, 2011

Planar k-Path in Subexponential Time and Polynomial Space.

[BibT_eX]

[DOI]

Matthias Mnich

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Approximation Algorithms for Minimum Chain Vertex Deletion.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

Bidimensionality and EPTAS.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Algorithmic Aspects of Dominator Colorings in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

Tight Bounds for Linkages in Planar Graphs.

[BibT_eX]

[DOI]

Isolde Adler

Stavros G. Kolliopoulos

Philipp Klaus Krause

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Paths, Flowers and Vertex Cover.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2011, 2011

2010

Iterative compression and exact algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Intractability of Clique-Width Parameterizations.

[BibT_eX]

[DOI]

SIAM J. Comput., 2010

Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2010

Parameterized algorithm for eternal vertex cover.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2010

Algorithmic Lower Bounds for Problems Parameterized with Clique-Width.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Ranking and Drawing in Subexponential Time.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Parameterized Algorithms for Boxicity.

[BibT_eX]

[DOI]

Abhijin Adiga

Rajesh Hemant Chitnis

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

The effect of girth on the kernelization complexity of Connected Dominating Set.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Determining the Winner of a Dodgson Election is Hard.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

The Curse of Connectivity: t-Total Vertex (Edge) Cover.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

Spanning Directed Trees with Many Leaves.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2009

On Two Techniques of Combining Branching and Treewidth.

[BibT_eX]

[DOI]

Algorithmica, 2009

Clique-width: on the price of generality.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Even Faster Algorithm for Set Splitting!

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

On the Directed Degree-Preserving Spanning Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

Simpler Parameterized Algorithm for OCT.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Incompressibility through Colors and IDs.

[BibT_eX]

[DOI]

Michael Dom

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Fast FAST.

[BibT_eX]

[DOI]

Noga Alon

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

The Budgeted Unique Coverage Problem and Color-Coding.

[BibT_eX]

[DOI]

Proceedings of the Computer Science, 2009

Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008

Parameterized Low-distortion Embeddings - Graph metrics into lines and trees

[BibT_eX]

[DOI]

CoRR, 2008

Parameterized Algorithms for Partial Cover Problems

[BibT_eX]

[DOI]

CoRR, 2008

Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles.

[BibT_eX]

[DOI]

Algorithmica, 2008

Degree-Constrained Subgraph Problems: Hardness and Approximation Results.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

A Moderately Exponential Time Algorithm for Full Degree Spanning Tree.

[BibT_eX]

[DOI]

Serge Gaspers

Alexey A. Stepanov

Proceedings of the Theory and Applications of Models of Computation, 2008

Capacitated Domination and Covering: A Parameterized Perspective.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008

Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem.

[BibT_eX]

[DOI]

Ignasi Sau

Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008

König Deletion Sets and Vertex Covers above the Matching Size.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Graph Layout Problems Parameterized by Vertex Cover.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Improving the gap of Erdös-Pósa property for minor-closed graph classes.

[BibT_eX]

Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

Parameterized Algorithms for Generalized Domination.

[BibT_eX]

[DOI]

Sriganesh Srihari

Proceedings of the Combinatorial Optimization and Applications, 2008

2007

Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2007

Improved fixed parameter tractable algorithms for two "edge" problems: MAXCUT and MAXDAG.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Parameterized Algorithms for Directed Maximum Leaf Problems.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Better Algorithms and Bounds for Directed Maximum Leaf Problems.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Improved Exact Algorithms for Counting 3- and 4-Colorings.

[BibT_eX]

[DOI]

Serge Gaspers

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006

Parameterized algorithms for feedback set problems and their duals in tournaments.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Faster fixed parameter tractable algorithms for finding feedback vertex sets.

[BibT_eX]

[DOI]

C. R. Subramanian

ACM Trans. Algorithms, 2006

Triangles, 4-Cycles and Parameterized (In-)Tractability.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2006

Branching and Treewidth Based Exact Algorithms.

[BibT_eX]

[DOI]

Serge Gaspers

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

2005

Faster algorithms for feedback vertex set.

[BibT_eX]

[DOI]

C. R. Subramanian

Electron. Notes Discret. Math., 2005

Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

2004

Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

2003

Parameterized Complexity of Directed Feedback Set Problems in Tournaments.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

2002

Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set.

[BibT_eX]

[DOI]