default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJanka Chlebíková
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j25]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: 113923 (2023)- [i10]Mani Ghahremani, Janka Chlebíková:
Safe Edges: A Study of Triangulation in Fill-in and Tree-Width Problems. CoRR abs/2306.17811 (2023) - 2022
- [j24]Miroslav Chlebík, Janka Chlebíková:
Weighted amplifiers and inapproximability results for Travelling Salesman problem. J. Comb. Optim. 43(5): 1368-1390 (2022) - 2021
- [j23]Cristina Bazgan, Pierre Cazals, Janka Chlebíková:
Degree-anonymization using edge rotations. Theor. Comput. Sci. 873: 1-15 (2021) - [j22]Janka Chlebíková, Clément Dallard:
Colourful components in k-caterpillars and planar graphs. Theor. Comput. Sci. 895: 137-150 (2021) - 2020
- [j21]Cristina Bazgan, Janka Chlebíková, Clément Dallard:
Graphs without a partition into two proportionally dense subgraphs. Inf. Process. Lett. 155 (2020) - [c18]Cristina Bazgan, Pierre Cazals, Janka Chlebíková:
How to Get a Degree-Anonymous Graph Using Minimum Number of Edge Rotations. COCOA 2020: 242-256
2010 – 2019
- 2019
- [j20]Cristina Bazgan, Janka Chlebíková, Clément Dallard, Thomas Pontoizeau:
Proportionally dense subgraph of maximum size: Complexity and approximation. Discret. Appl. Math. 270: 25-36 (2019) - [c17]Janka Chlebíková, Clément Dallard, Niklas Paulsen:
Complexity of Scheduling for DARP with Soft Ride Times. CIAC 2019: 149-160 - [c16]Miroslav Chlebík, Janka Chlebíková:
Approximation Hardness of Travelling Salesman via Weighted Amplifiers. COCOON 2019: 115-127 - [c15]Janka Chlebíková, Clément Dallard:
Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs. IWOCA 2019: 136-147 - [i9]Janka Chlebíková, Clément Dallard:
Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs. CoRR abs/1902.11191 (2019) - [i8]Janka Chlebíková, Cristina Bazgan, Clément Dallard, Thomas Pontoizeau:
Proportionally dense subgraph of maximum size: complexity and approximation. CoRR abs/1903.06579 (2019) - 2018
- [j19]Cristina Bazgan, Janka Chlebíková, Thomas Pontoizeau:
Structural and Algorithmic Properties of 2-Community Structures. Algorithmica 80(6): 1890-1908 (2018) - [i7]Cristina Bazgan, Janka Chlebíková, Clément Dallard:
Graphs without a partition into two proportionally dense subgraphs. CoRR abs/1806.10963 (2018) - 2017
- [j18]Janka Chlebíková, Morgan Chopin:
The firefighter problem: Further steps in understanding its complexity. Theor. Comput. Sci. 676: 42-51 (2017) - 2015
- [c14]Cristina Bazgan, Janka Chlebíková, Thomas Pontoizeau:
New Insight into 2-Community Structures in Graphs with Applications in Social Networks. COCOA 2015: 236-250 - 2014
- [j17]Miroslav Chlebík, Janka Chlebíková:
Connection between conjunctive capacity and structural properties of graphs. Theor. Comput. Sci. 554: 109-118 (2014) - [c13]Janka Chlebíková, Morgan Chopin:
The Firefighter Problem: A Structural Analysis. IPEC 2014: 172-183 - 2013
- [c12]Miroslav Chlebík, Janka Chlebíková:
On the Conjunctive Capacity of Graphs. COCOON 2013: 280-291 - [i6]Janka Chlebíková, Morgan Chopin:
The Firefighter Problem: A Structural Analysis. CoRR abs/1310.2322 (2013) - [i5]Janka Chlebíková, Morgan Chopin:
The Firefighter Problem: A Structural Analysis. Electron. Colloquium Comput. Complex. TR13 (2013)
2000 – 2009
- 2009
- [j16]Miroslav Chlebík, Janka Chlebíková:
Hardness of approximation for orthogonal rectangle packing and covering problems. J. Discrete Algorithms 7(3): 291-305 (2009) - 2008
- [j15]Miroslav Chlebík, Janka Chlebíková:
Crown reductions for the Minimum Weighted Vertex Cover problem. Discret. Appl. Math. 156(3): 292-312 (2008) - [j14]Miroslav Chlebík, Janka Chlebíková:
Approximation hardness of dominating set problems in bounded degree graphs. Inf. Comput. 206(11): 1264-1275 (2008) - [j13]Miroslav Chlebík, Janka Chlebíková:
The Steiner tree problem on graphs: Inapproximability results. Theor. Comput. Sci. 406(3): 207-214 (2008) - 2007
- [j12]Miroslav Chlebík, Janka Chlebíková:
Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover. Discret. Appl. Math. 155(2): 172-179 (2007) - [j11]Janka Chlebíková, Klaus Jansen:
The d-precoloring problem for k-degenerate graphs. Discret. Math. 307(16): 2042-2052 (2007) - [j10]Janka Chlebíková:
A characterization of some graph classes using excluded minors. Period. Math. Hung. 55(1): 1-9 (2007) - [j9]Miroslav Chlebík, Janka Chlebíková:
The Complexity of Combinatorial Optimization Problems on d-Dimensional Boxes. SIAM J. Discret. Math. 21(1): 158-169 (2007) - 2006
- [j8]Miroslav Chlebík, Janka Chlebíková:
Hard coloring problems in low degree planar bipartite graphs. Discret. Appl. Math. 154(14): 1960-1965 (2006) - [j7]Miroslav Chlebík, Janka Chlebíková:
Approximation hardness of edge dominating set problems. J. Comb. Optim. 11(3): 279-290 (2006) - [j6]Janka Chlebíková, Deshi Ye, Hu Zhang:
Assign ranges in general ad-hoc networks. J. Parallel Distributed Comput. 66(4): 489-498 (2006) - [j5]Miroslav Chlebík, Janka Chlebíková:
Complexity of approximating bounded variants of optimization problems. Theor. Comput. Sci. 354(3): 320-338 (2006) - [c11]Miroslav Chlebík, Janka Chlebíková:
Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations. CIAC 2006: 199-210 - [i4]Janka Chlebíková, Miroslav Chlebík:
Hardness of asymptotic approximation for orthogonal rectangle packing and covering problems. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c10]Janka Chlebíková, Deshi Ye, Hu Zhang:
Assign Ranges in General Ad-Hoc Networks. AAIM 2005: 411-421 - [c9]Miroslav Chlebík, Janka Chlebíková:
Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes. SODA 2005: 267-276 - 2004
- [c8]Miroslav Chlebík, Janka Chlebíková:
Approximation Hardness of Dominating Set Problems. ESA 2004: 192-203 - [c7]Miroslav Chlebík, Janka Chlebíková:
On Approximation Hardness of the Minimum 2SAT-DELETION Problem. MFCS 2004: 263-273 - [c6]Miroslav Chlebík, Janka Chlebíková:
On Approximability of the Independent Set Problem for Low Degree Graphs. SIROCCO 2004: 47-56 - [c5]Miroslav Chlebík, Janka Chlebíková:
Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity. SWAT 2004: 174-186 - [i3]Miroslav Chlebík, Janka Chlebíková:
Crown reductions for the Minimum Weighted Vertex Cover problem. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [c4]Miroslav Chlebík, Janka Chlebíková:
Approximation Hardness for Small Occurrence Instances of NP-Hard Problems. CIAC 2003: 152-164 - [c3]Miroslav Chlebík, Janka Chlebíková:
Inapproximability Results for Bounded Variants of Optimization Problems. FCT 2003: 27-38 - [c2]Miroslav Chlebík, Janka Chlebíková:
Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching. ISAAC 2003: 415-424 - [i2]Janka Chlebíková, Miroslav Chlebík:
Inapproximability results for bounded variants of optimization problems. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j4]Janka Chlebíková:
The structure of obstructions to treewidth and pathwidth. Discret. Appl. Math. 120(1-3): 61-71 (2002) - [j3]Janka Chlebíková:
Partial k-trees with maximum chromatic number. Discret. Math. 259(1-3): 269-276 (2002) - [c1]Miroslav Chlebík, Janka Chlebíková:
Approximation Hardness of the Steiner Tree Problem on Graphs. SWAT 2002: 170-179 - [i1]Janka Chlebíková, Miroslav Chlebík:
Approximation Hardness for Small Occurrence Instances of NP-Hard Problem. Electron. Colloquium Comput. Complex. TR02 (2002)
1990 – 1999
- 1999
- [j2]Janka Chlebíková:
The structure of obstructions to treewidth and pathwidth. Electron. Notes Discret. Math. 3: 33-38 (1999) - 1996
- [j1]Janka Chlebíková:
Approximating the Maximally Balanced Connected Partition Problem in Graphs. Inf. Process. Lett. 60(5): 223-230 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
