Janka Chlebíková - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 47 from 47

2023

Impact of soft ride time constraints on the complexity of scheduling in Dial-A-Ride ProblemsJanka Chlebíková, Clément Dallard, Niklas Paulsen. TCS, 960:113923, June 2023. [doi]

2022

Weighted amplifiers and inapproximability results for Travelling Salesman problemMiroslav Chlebík, Janka Chlebíková. jco, 43(5):1368-1390, 2022. [doi]

2021

Degree-anonymization using edge rotationsCristina Bazgan, Pierre Cazals, Janka Chlebíková. TCS, 873:1-15, 2021. [doi]

k-caterpillars and planar graphsJanka Chlebíková, Clément Dallard. TCS, 895:137-150, 2021. [doi]

2020

Graphs without a partition into two proportionally dense subgraphsCristina Bazgan, Janka Chlebíková, Clément Dallard. ipl, 155, 2020. [doi]

How to Get a Degree-Anonymous Graph Using Minimum Number of Edge RotationsCristina Bazgan, Pierre Cazals, Janka Chlebíková. cocoa 2020: 242-256 [doi]

2019

2018

Structural and Algorithmic Properties of 2-Community StructuresCristina Bazgan, Janka Chlebíková, Thomas Pontoizeau. algorithmica, 80(6):1890-1908, 2018. [doi]

2017

The firefighter problem: Further steps in understanding its complexityJanka Chlebíková, Morgan Chopin. TCS, 676:42-51, 2017. [doi]

2015

New Insight into 2-Community Structures in Graphs with Applications in Social NetworksCristina Bazgan, Janka Chlebíková, Thomas Pontoizeau. cocoa 2015: 236-250 [doi]

2014

Connection between conjunctive capacity and structural properties of graphsMiroslav Chlebík, Janka Chlebíková. TCS, 554:109-118, 2014. [doi]

The Firefighter Problem: A Structural AnalysisJanka Chlebíková, Morgan Chopin. iwpec 2014: 172-183 [doi]

2013

On the Conjunctive Capacity of GraphsMiroslav Chlebík, Janka Chlebíková. cocoon 2013: 280-291 [doi]

The Firefighter Problem: A Structural AnalysisJanka Chlebíková, Morgan Chopin. eccc, 20:162, 2013. [doi]

2008

Approximation hardness of dominating set problems in bounded degree graphsMiroslav Chlebík, Janka Chlebíková. iandc, 206(11):1264-1275, 2008. [doi]

Crown reductions for the Minimum Weighted Vertex Cover problemMiroslav Chlebík, Janka Chlebíková. DAM, 156(3):292-312, 2008. [doi]

The Steiner tree problem on graphs: Inapproximability resultsMiroslav Chlebík, Janka Chlebíková. TCS, 406(3):207-214, 2008. [doi]

2007

The Complexity of Combinatorial Optimization Problems on d-Dimensional BoxesMiroslav Chlebík, Janka Chlebíková. siamdm, 21(1):158-169, 2007. [doi]

Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex CoverMiroslav Chlebík, Janka Chlebíková. DAM, 155(2):172-179, 2007. [doi]

A characterization of some graph classes using excluded minorsJanka Chlebíková. pmh, 55(1):1-9, 2007. [doi]

The d-precoloring problem for k-degenerate graphsJanka Chlebíková, Klaus Jansen. DM, 307(16):2042-2052, 2007. [doi]

2006

2005

Approximation hardness of optimization problems in intersection graphs of ::::d::::-dimensional boxesMiroslav Chlebík, Janka Chlebíková. soda 2005: 267-276 [doi]

Assign Ranges in General Ad-Hoc NetworksJanka Chlebíková, Deshi Ye, Hu Zhang. AAIM 2005: 411-421 [doi]

2004

2003

2002

Approximation Hardness of the Steiner Tree Problem on GraphsMiroslav Chlebík, Janka Chlebíková. swat 2002: 170-179 [doi]

Partial ::::k::::-trees with maximum chromatic numberJanka Chlebíková. DM, 259(1-3):269-276, 2002. [doi]

Approximation Hardness for Small Occurrence Instances of NP-Hard ProblemJanka Chlebíková, Miroslav Chlebík. eccc, (073), 2002. [doi]

The structure of obstructions to treewidth and pathwidthJanka Chlebíková. DAM, 120(1-3):61-71, 2002.

1999

The structure of obstructions to treewidth and pathwidthJanka Chlebíková. endm, 3:33-38, 1999. [doi]

1996

Approximating the Maximally Balanced Connected Partition Problem in GraphsJanka Chlebíková. ipl, 60(5):223-230, 1996.

Sign in or sign up to see more results.

runs on WebDSL