Janka Chlebíková

Publication Activity (10 Years)

Years Active: 1996-2023
Publications (10 Years): 16

Top Topics

Structural Properties

Community Structure

Computationally Challenging

Top Venues

Theor. Comput. Sci.

Publications

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