| Publication | Date of Publication | Type |
|---|
Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems
Theoretical Computer Science | 2023-05-19 | Paper |
How to get a degree-anonymous graph using minimum number of edge rotations
| 2023-03-21 | Paper |
Weighted amplifiers and inapproximability results for travelling salesman problem
Journal of Combinatorial Optimization | 2022-07-18 | Paper |
Colourful components in \(k\)-caterpillars and planar graphs
Theoretical Computer Science | 2021-11-18 | Paper |
Degree-anonymization using edge rotations
Theoretical Computer Science | 2021-06-22 | Paper |
Towards a complexity dichotomy for colourful components problems on \(k\)-caterpillars and small-degree planar graphs
| 2020-02-25 | Paper |
Approximation hardness of Travelling Salesman via weighted amplifiers
| 2020-02-24 | Paper |
Complexity of scheduling for DARP with soft ride times
| 2020-02-06 | Paper |
Graphs without a partition into two proportionally dense subgraphs
Information Processing Letters | 2019-12-19 | Paper |
Proportionally dense subgraph of maximum size: complexity and approximation
Discrete Applied Mathematics | 2019-11-06 | Paper |
Structural and algorithmic properties of 2-community structures
Algorithmica | 2018-06-01 | Paper |
The firefighter problem: further steps in understanding its complexity
Theoretical Computer Science | 2017-05-11 | Paper |
New insight into 2-community structures in graphs with applications in social networks
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
The Firefighter Problem: A Structural Analysis
Parameterized and Exact Computation | 2015-09-15 | Paper |
Approximation hardness of optimization problems in intersection graphs of \(d\)-dimensional boxes
| 2014-10-13 | Paper |
Connection between conjunctive capacity and structural properties of graphs
Theoretical Computer Science | 2014-10-06 | Paper |
On the conjunctive capacity of graphs
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Inapproximability results for bounded variants of optimization problems.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Hardness of approximation for orthogonal rectangle packing and covering problems
Journal of Discrete Algorithms | 2009-06-24 | Paper |
Approximation hardness of dominating set problems in bounded degree graphs
Information and Computation | 2008-12-03 | Paper |
The Steiner tree problem on graphs: inapproximability results
Theoretical Computer Science | 2008-11-12 | Paper |
A characterization of some graph classes using excluded minors
Periodica Mathematica Hungarica | 2008-10-22 | Paper |
The Complexity of Combinatorial Optimization Problems on d‐Dimensional Boxes
SIAM Journal on Discrete Mathematics | 2008-03-28 | Paper |
Crown reductions for the minimum weighted vertex cover problem
Discrete Applied Mathematics | 2008-02-26 | Paper |
The \(d\)-precoloring problem for \(k\)-degenerate graphs
Discrete Mathematics | 2007-06-26 | Paper |
Approximation hardness of edge dominating set problems
Journal of Combinatorial Optimization | 2007-06-21 | Paper |
Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover
Discrete Applied Mathematics | 2007-02-19 | Paper |
Hard coloring problems in low degree planar bipartite graphs
Discrete Applied Mathematics | 2006-09-28 | Paper |
Assign ranges in general ad-hoc networks
Journal of Parallel and Distributed Computing | 2006-08-04 | Paper |
Complexity of approximating bounded variants of optimization problems
Theoretical Computer Science | 2006-04-28 | Paper |
Algorithmic Applications in Management
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
scientific article; zbMATH DE number 2089220 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 2011853 (Why is no real title available?)
| 2003-12-02 | Paper |
Partial \(k\)-trees with maximum chromatic number
Discrete Mathematics | 2003-03-16 | Paper |
The structure of obstructions to treewidth and pathwidth
Discrete Applied Mathematics | 2002-08-29 | Paper |
The structure of obstructions to treewidth and pathwidth
| 2001-09-23 | Paper |
Approximating the Maximally Balanced Connected Partition Problem in graphs
Information Processing Letters | 1997-02-28 | Paper |
scientific article; zbMATH DE number 772777 (Why is no real title available?)
| 1995-07-12 | Paper |
