| Publication | Date of Publication | Type |
|---|
Connectivity in the presence of an opponent
| 2025-01-06 | Paper |
An improved approximation algorithm for metric triangle packing
| 2024-11-12 | Paper |
An improved kernel and parameterized algorithm for almost induced matching
| 2024-11-12 | Paper |
Parameterized algorithms for cluster vertex deletion on degree-4 graphs and general graphs
| 2024-08-22 | Paper |
A discharging method: improved kernels for edge triangle packing and covering
| 2024-08-22 | Paper |
Improved approximation algorithms for multidepot capacitated vehicle routing
| 2024-08-22 | Paper |
A deterministic approximation algorithm for metric triangle packing
Theoretical Computer Science | 2024-08-20 | Paper |
Improved approximation algorithms for the traveling tournament problem
| 2024-08-06 | Paper |
Improved approximation algorithms for cycle and path packings
| 2024-07-19 | Paper |
Kernelization for edge triangle packing and covering via a discharging method
Theoretical Computer Science | 2024-06-19 | Paper |
Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs
Algorithmica | 2024-04-24 | Paper |
Improved parameterized algorithms for mixed domination
Algorithmic Aspects in Information and Management | 2024-02-23 | Paper |
Exact algorithms for restricted subset feedback vertex set in chordal and split graphs
Theoretical Computer Science | 2024-01-02 | Paper |
Further improvements for SAT in terms of formula length
Information and Computation | 2023-09-27 | Paper |
A parameterized algorithm for subset feedback vertex set in tournaments
Theoretical Computer Science | 2023-09-21 | Paper |
Exact and parameterized algorithms for restricted subset feedback vertex set in chordal graphs
Lecture Notes in Computer Science | 2023-08-04 | Paper |
A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem
Computers & Operations Research | 2023-07-04 | Paper |
A \(5k\)-vertex kernel for 3-path vertex cover
Theoretical Computer Science | 2023-05-12 | Paper |
Exact algorithms for maximum weighted independent set on sparse graphs (extended abstract)
| 2023-03-30 | Paper |
A further improvement on approximating TTP-2
| 2023-03-30 | Paper |
The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles
Discrete Mathematics | 2023-02-21 | Paper |
scientific article; zbMATH DE number 7651993 (Why is no real title available?)
| 2023-02-09 | Paper |
Upper and lower bounds on approximating weighted mixed domination
Theoretical Computer Science | 2022-11-17 | Paper |
Parameterized algorithms and complexity for the traveling purchaser problem and its variants
Journal of Combinatorial Optimization | 2022-10-18 | Paper |
An improved kernel for planar vertex-disjoint triangle packing
Theoretical Computer Science | 2022-06-13 | Paper |
A fast algorithm for SAT in terms of formula length
| 2022-03-22 | Paper |
A simple and improved parameterized algorithm for bicluster editing
Information Processing Letters | 2021-12-14 | Paper |
A guide to graph algorithms
| 2021-12-06 | Paper |
An improved upper bound for SAT
Theoretical Computer Science | 2021-09-27 | Paper |
Brief announcement: Bounded-degree cut is fixed-parameter tractable
| 2021-07-28 | Paper |
Parameterized algorithms and kernels for almost induced matching
Theoretical Computer Science | 2020-11-06 | Paper |
Characterizing star-PCGs
Algorithmica | 2020-10-12 | Paper |
Improved parameterized algorithms and kernels for mixed domination
Theoretical Computer Science | 2020-04-06 | Paper |
Upper and lower bounds on approximating weighted mixed domination
Lecture Notes in Computer Science | 2020-02-24 | Paper |
Parameterized algorithms for the Traveling Purchaser problem with additional constraints
| 2020-02-24 | Paper |
Some reduction operations to pairwise compatibility graphs
Information Processing Letters | 2019-11-21 | Paper |
A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing
Information Processing Letters | 2018-12-05 | Paper |
Characterizing star-PCGs
Lecture Notes in Computer Science | 2018-10-04 | Paper |
scientific article; zbMATH DE number 6861995 (Why is no real title available?)
| 2018-04-19 | Paper |
An improved approximation algorithm for the traveling tournament problem with maximum trip length two
| 2018-03-21 | Paper |
A refined algorithm for maximum independent set in degree-4 graphs
Journal of Combinatorial Optimization | 2017-11-16 | Paper |
Exact algorithms for maximum induced matching
Information and Computation | 2017-09-28 | Paper |
Exact algorithms for maximum independent set
Information and Computation | 2017-08-08 | Paper |
Linear kernels for separating a graph into components of bounded size
Journal of Computer and System Sciences | 2017-06-30 | Paper |
Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
Lecture Notes in Computer Science | 2017-05-19 | Paper |
Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
Theoretical Computer Science | 2017-02-06 | Paper |
Complexity and kernels for bipartition into degree-bounded induced graphs
Theoretical Computer Science | 2016-12-23 | Paper |
Almost induced matching: linear kernels and parameterized algorithms
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
On a generalization of Nemhauser and Trotter's local optimization theorem
Journal of Computer and System Sciences | 2016-11-14 | Paper |
A parameterized algorithm for bounded-degree vertex deletion
Lecture Notes in Computer Science | 2016-09-02 | Paper |
An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure
Algorithmica | 2016-03-29 | Paper |
An improved exact algorithm for TSP in graphs of maximum degree 4
Theory of Computing Systems | 2016-03-09 | Paper |
On a generalization of Nemhauser and Trotter's local optimization theorem
Lecture Notes in Computer Science | 2016-01-11 | Paper |
An exact algorithm for maximum independent set in degree-5 graphs
Discrete Applied Mathematics | 2015-12-10 | Paper |
Faster computation of the maximum dissociation set and minimum 3-path vertex cover in graphs
Frontiers in Algorithmics | 2015-11-12 | Paper |
An improved exact algorithm for maximum induced matching
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Complexity and kernels for bipartition into degree-bounded induced graphs
Algorithms and Computation | 2015-09-11 | Paper |
An improved exact algorithm for undirected feedback vertex set
Journal of Combinatorial Optimization | 2015-07-28 | Paper |
Exact algorithms for dominating induced matching based on graph partition
Discrete Applied Mathematics | 2015-07-06 | Paper |
New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set
Theory of Computing Systems | 2015-05-29 | Paper |
A new linear kernel for undirected planar feedback vertex set: smaller and simpler
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
On the exact block cover problem
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
A quadratic vertex kernel for feedback arc set in bipartite tournaments
Algorithmica | 2015-03-02 | Paper |
A refined exact algorithm for edge dominating set
Theoretical Computer Science | 2014-12-02 | Paper |
An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2014-04-03 | Paper |
Exact Algorithms for Maximum Independent Set
Algorithms and Computation | 2014-01-14 | Paper |
New parameterized algorithms for the edge dominating set problem
Theoretical Computer Science | 2014-01-13 | Paper |
Parameterized edge dominating set in graphs with degree bounded by 3
Theoretical Computer Science | 2013-12-19 | Paper |
An Improved Exact Algorithm for Undirected Feedback Vertex Set
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure
Lecture Notes in Computer Science | 2013-05-28 | Paper |
Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs
Theoretical Computer Science | 2013-02-19 | Paper |
FPTASs for trimming weighted trees
Theoretical Computer Science | 2013-02-19 | Paper |
New results on polynomial inapproximability and fixed parameter approximability of \textsc{Edge Dominating Set}
Parameterized and Exact Computation | 2013-01-07 | Paper |
An improved exact algorithm for TSP in degree-4 graphs
Lecture Notes in Computer Science | 2012-09-25 | Paper |
A quadratic vertex kernel for feedback arc set in bipartite tournaments
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
A refined exact algorithm for edge dominating set
Lecture Notes in Computer Science | 2012-07-16 | Paper |
Finding minimum 3-way cuts in hypergraphs
Information Processing Letters | 2012-03-19 | Paper |
An FPT algorithm for edge subset feedback edge set
Information Processing Letters | 2012-03-09 | Paper |
New Parameterized Algorithms for the Edge Dominating Set Problem
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Further Improvement on Maximum Independent Set in Degree-4 Graphs
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
Parameterized edge dominating set in cubic graphs (extended abstract)
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem
Algorithmica | 2011-03-30 | Paper |
Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
FPTAS’s for Some Cut Problems in Weighted Trees
Frontiers in Algorithmics | 2010-09-07 | Paper |
Simple and improved parameterized algorithms for multiterminal cuts
Theory of Computing Systems | 2010-08-13 | Paper |
A note on vertex cover in graphs with maximum degree 3
Lecture Notes in Computer Science | 2010-07-20 | Paper |
A simple and fast algorithm for Maximum Independent Set in 3-degree graphs (extended abstract)
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts
Algorithms and Computation | 2009-01-29 | Paper |
Algorithms for Multiterminal Cuts
Computer Science – Theory and Applications | 2008-06-05 | Paper |
Finding Minimum 3-Way Cuts in Hypergraphs
Lecture Notes in Computer Science | 2008-05-27 | Paper |
An extension of the quadratic \(B\)-spline and its application
| 2006-08-17 | Paper |
