Janka Chlebíková

53 papers A* 1A 1B 5C 7Misc 2Journal 35Unranked 2
YearRankTypeTitle / Venue / Authors
2023 J jnl
Impact of soft ride time constraints on the complexity of scheduling in Dial-A-Ride Problems.
Theor. Comput. Sci.
Janka Chlebíková, Clément Dallard, Niklas Paulsen
2023 J jnl
Safe Edges: A Study of Triangulation in Fill-in and Tree-Width Problems.
CoRR
Mani Ghahremani, Janka Chlebíková
2022 J jnl
Weighted amplifiers and inapproximability results for Travelling Salesman problem.
J. Comb. Optim.
Miroslav Chlebík, Janka Chlebíková
2021 J jnl
Colourful components in
Theor. Comput. Sci.
Janka Chlebíková, Clément Dallard
2021 J jnl
Degree-anonymization using edge rotations.
Theor. Comput. Sci.
Cristina Bazgan, Pierre Cazals, Janka Chlebíková
2020 J jnl
Graphs without a partition into two proportionally dense subgraphs.
Inf. Process. Lett.
Cristina Bazgan, Janka Chlebíková, Clément Dallard
2020 C conf
How to Get a Degree-Anonymous Graph Using Minimum Number of Edge Rotations.
COCOA
Cristina Bazgan, Pierre Cazals, Janka Chlebíková
2019 Misc conf
Approximation Hardness of Travelling Salesman via Weighted Amplifiers.
COCOON
Miroslav Chlebík, Janka Chlebíková
2019 C conf
Complexity of Scheduling for DARP with Soft Ride Times.
CIAC
Janka Chlebíková, Clément Dallard, Niklas Paulsen
2019 J jnl
Proportionally dense subgraph of maximum size: Complexity and approximation.
Discret. Appl. Math.
Cristina Bazgan, Janka Chlebíková, Clément Dallard, Thomas Pontoizeau
2019 J jnl
Proportionally dense subgraph of maximum size: complexity and approximation.
CoRR
Janka Chlebíková, Cristina Bazgan, Clément Dallard, Thomas Pontoizeau
2019 C conf
Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs.
IWOCA
Janka Chlebíková, Clément Dallard
2019 J jnl
Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs.
CoRR
Janka Chlebíková, Clément Dallard
2018 J jnl
Graphs without a partition into two proportionally dense subgraphs.
CoRR
Cristina Bazgan, Janka Chlebíková, Clément Dallard
2018 J jnl
Structural and Algorithmic Properties of 2-Community Structures.
Algorithmica
Cristina Bazgan, Janka Chlebíková, Thomas Pontoizeau
2017 J jnl
The firefighter problem: Further steps in understanding its complexity.
Theor. Comput. Sci.
Janka Chlebíková, Morgan Chopin
2015 C conf
New Insight into 2-Community Structures in Graphs with Applications in Social Networks.
COCOA
Cristina Bazgan, Janka Chlebíková, Thomas Pontoizeau
2014 J jnl
Connection between conjunctive capacity and structural properties of graphs.
Theor. Comput. Sci.
Miroslav Chlebík, Janka Chlebíková
2014 B conf
The Firefighter Problem: A Structural Analysis.
IPEC
Janka Chlebíková, Morgan Chopin
2013 Misc conf
On the Conjunctive Capacity of Graphs.
COCOON
Miroslav Chlebík, Janka Chlebíková
2013 J jnl
The Firefighter Problem: A Structural Analysis.
CoRR
Janka Chlebíková, Morgan Chopin
2013 J jnl
The Firefighter Problem: A Structural Analysis.
Electron. Colloquium Comput. Complex.
Janka Chlebíková, Morgan Chopin
2009 J jnl
Hardness of approximation for orthogonal rectangle packing and covering problems.
J. Discrete Algorithms
Miroslav Chlebík, Janka Chlebíková
2008 J jnl
Approximation hardness of dominating set problems in bounded degree graphs.
Inf. Comput.
Miroslav Chlebík, Janka Chlebíková
2008 J jnl
Crown reductions for the Minimum Weighted Vertex Cover problem.
Discret. Appl. Math.
Miroslav Chlebík, Janka Chlebíková
2008 J jnl
The Steiner tree problem on graphs: Inapproximability results.
Theor. Comput. Sci.
Miroslav Chlebík, Janka Chlebíková
2007 J jnl
A characterization of some graph classes using excluded minors.
Period. Math. Hung.
Janka Chlebíková
2007 J jnl
Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover.
Discret. Appl. Math.
Miroslav Chlebík, Janka Chlebíková
2007 J jnl
The Complexity of Combinatorial Optimization Problems on d-Dimensional Boxes.
SIAM J. Discret. Math.
Miroslav Chlebík, Janka Chlebíková
2007 J jnl
The d-precoloring problem for k-degenerate graphs.
Discret. Math.
Janka Chlebíková, Klaus Jansen
2006 J jnl
Approximation hardness of edge dominating set problems.
J. Comb. Optim.
Miroslav Chlebík, Janka Chlebíková
2006 J jnl
Assign ranges in general ad-hoc networks.
J. Parallel Distributed Comput.
Janka Chlebíková, Deshi Ye, Hu Zhang
2006 J jnl
Complexity of approximating bounded variants of optimization problems.
Theor. Comput. Sci.
Miroslav Chlebík, Janka Chlebíková
2006 J jnl
Hard coloring problems in low degree planar bipartite graphs.
Discret. Appl. Math.
Miroslav Chlebík, Janka Chlebíková
2006 J jnl
Hardness of asymptotic approximation for orthogonal rectangle packing and covering problems
Electron. Colloquium Comput. Complex.
Janka Chlebíková, Miroslav Chlebík
2006 C conf
Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations.
CIAC
Miroslav Chlebík, Janka Chlebíková
2005 A* conf
Approximation hardness of optimization problems in intersection graphs of
SODA
Miroslav Chlebík, Janka Chlebíková
2005 C conf
Assign Ranges in General Ad-Hoc Networks.
AAIM
Janka Chlebíková, Deshi Ye, Hu Zhang
2004 A conf
Approximation Hardness of Dominating Set Problems.
ESA
Miroslav Chlebík, Janka Chlebíková
2004 J jnl
Crown reductions for the Minimum Weighted Vertex Cover problem
Electron. Colloquium Comput. Complex.
Miroslav Chlebík, Janka Chlebíková
2004 — conf
Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity.
SWAT
Miroslav Chlebík, Janka Chlebíková
2004 B conf
On Approximability of the Independent Set Problem for Low Degree Graphs.
SIROCCO
Miroslav Chlebík, Janka Chlebíková
2004 B conf
On Approximation Hardness of the Minimum 2SAT-DELETION Problem.
MFCS
Miroslav Chlebík, Janka Chlebíková
2003 C conf
Approximation Hardness for Small Occurrence Instances of NP-Hard Problems.
CIAC
Miroslav Chlebík, Janka Chlebíková
2003 B conf
Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching.
ISAAC
Miroslav Chlebík, Janka Chlebíková
2003 B conf
Inapproximability Results for Bounded Variants of Optimization Problems.
FCT
Miroslav Chlebík, Janka Chlebíková
2003 J jnl
Inapproximability results for bounded variants of optimization problems
Electron. Colloquium Comput. Complex.
Janka Chlebíková, Miroslav Chlebík
2002 J jnl
Approximation Hardness for Small Occurrence Instances of NP-Hard Problem
Electron. Colloquium Comput. Complex.
Janka Chlebíková, Miroslav Chlebík
2002 — conf
Approximation Hardness of the Steiner Tree Problem on Graphs.
SWAT
Miroslav Chlebík, Janka Chlebíková
2002 J jnl
Partial
Discret. Math.
Janka Chlebíková
2002 J jnl
The structure of obstructions to treewidth and pathwidth.
Discret. Appl. Math.
Janka Chlebíková
1999 J jnl
The structure of obstructions to treewidth and pathwidth.
Electron. Notes Discret. Math.
Janka Chlebíková
1996 J jnl
Approximating the Maximally Balanced Connected Partition Problem in Graphs.
Inf. Process. Lett.
Janka Chlebíková