|
Referred international journals |
|
- Miroslav Chlebík and Janka Chlebíková, The Steiner Tree problem
on graphs: inapproximability results, to appear in Theoretical
Computer Science
- Miroslav Chlebík and Janka Chlebíková, Crown reductions for the
Minimum Weighted Vertex Cover problem, Discrete Applied
Mathematics, 156, no. 3 (2008), 292-312
- Miroslav Chlebík and Janka Chlebíková,
The complexity of combinatorial optimization problems on d-dimensional boxes,
SIAM Journal of Discrete Mathematics, 22/1(2007), pp. 158-169.
- Janka Chlebíková, Some New Excluded Minor Theorems, Periodica
Mathematics Hungarica, 55, no. 1 (2007), pp. 47--55
- Janka Chlebíková and Klaus Jansen, The d-precoloring problem on
k-degenerate graphs, Discrete Mathematics, 307 (2007), pp.
2042-2052.
- Miroslav Chlebík and Janka Chlebíková, Minimum 2SAT-DELETION
problem: inapproximability results and relations to Minimum Vertex
Cover, Discrete Applied Mathematics,
155, no. 2 (2007), pp. 172-179.
- Miroslav Chlebík and Janka Chlebíková,
Hard coloring problems in low degree planar bipartite graphs,
Discrete Applied Mathematics 154(2006), pp. 1960-1965.
- Miroslav Chlebík and Janka Chlebíková, Complexity of
approximating bounded variants of optimization problems,
Theoretical Computer Science 354(2006), pp. 320-338.
- Miroslav Chlebík and Janka Chlebíková, Inapproximability results
for Edge Dominating Set problems in graphs, Journal of Combinatorial Optimization
11(2006), pp. 279-290.
- Janka Chlebíková, Deshi Ye, and Hu Zhang,
Assign Ranges in General Ad-Hoc
Networks, Journal of Parallel and Distributed Computing
66-4(2006), pp. 489-498.
- Janka Chlebíková, Partial
k-trees with maximum chromatic number, Discrete Mathematics 259, no.
1-3 (2002), pp. 269-276.
- Janka Chlebíková The structure of obstructions to treewidth and
pathwidth, Discrete Applied Mathematics 120, no. 1-3 (2002), pp.
59-69.
- Janka Chlebíková, The structure of obstructions to treewidth and
pathwidth, Electronic Notes Discrete Math. 3
- Janka Chlebíková, Approximating the maximally balanced connected
partition problem in graphs, Information Processing Letters
60(1996), 225-230
- Janka Chlebíková, On tree width of a graph, Acta Math. Univ.
Comenianae, LXI, no. 2 (1992), 225-236.
|
|
Referred international computer science
conferences |
|
|
|
- Miroslav Chlebík and Janka Chlebíková, Inapproximability results for orthogonal rectangle packing problems with
rotations, Proc. of 6th
Conference on Algorithms and Complexity (CIAC 2006), Rome, Italy, May
29-31, 2006, LNCS, 2006, Springer, 199-210.
- Janka Chlebíková Dehi Ye and Hu Zhang, Assign Ranges in General
Ad-Hoc Networks, Proc. of the 1st Conference on Algorithmic
Applications in Management (AAIM 2005), June 22-24, 2005, Xian Shaanxi,
China, LNCS 3521, 411-421.
- Miroslav Chlebík and Janka Chlebíková, Approximation Hardness of
Optimization Problems in Intersection Graphs of d-dimensional Boxes,
Proc. of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA
2005), Vancouver, January 23-25, 2005, Canada, 267-276.
- Miroslav Chlebík and Janka Chlebíková, Approximation Hardness of
Dominating Set Problems , Proc. of 12th European Symposium on
Algorithms (ESA 2004), Bergen, Norway, September 14-17, 2004, LNCS 3221,
Springer, 192-203.
- Miroslav Chlebík and Janka Chlebíková, On Approximation Hardness
of the Minimum 2SAT-DELETION Problem, Proc. of 29th International
Symposium on Mathematical Foundations of Computer Science (MFCS 2004),
Prague, Czech Republic, August 22-27, 2004, LNCS 3153, Springer,
263-273.
- Miroslav Chlebík and Janka Chlebíková, On Approximability of the
Independent Set Problem for Low Degree Graphs, Proc. of 11th
Colloquium on Structural Information and Communication Complexity
(SIROCCO 2004), Smolenice Castle, Slovakia, June 21-23, 2004, LNCS 3104,
Springer, 47-56
- Miroslav Chlebík and Janka Chlebíková, Improvement of
Nemhauser-Trotter Theorem and its applications in parametrized
complexity, Proc. of 9th Scandinavian Workshop on Algorithm Theory
(SWAT 2004), Denmark, July 8-10, 2004, LNCS 3111, Springer, 174-186.
- Miroslav Chlebík and Janka Chlebíková, Approximation Hardness of
Minimum Edge Dominating Set and Minimum Maximal Matching, Proc. of
14th International Symposium on Algorithms and Computation (ISAAC 2003),
Kyoto, Japan, December 15-17, 2003, LNCS 2906, Springer, 415-424.
- Miroslav Chlebík and Janka Chlebíková, Inapproximability results
for bounded variants of optimization problems, Proc. of 14th
International Symposium on Fundamentals of Computation Theory (FCT
2003), Malmo, Sweden, August 12-15, 2003, LNCS 2751, 2003, Springer,
27-38.
- Miroslav Chlebík and Janka Chlebíková, Approximation Hardness for
Small Occurrence Instances of NP-Hard Problems, Proc. of 5th
Conference on Algorithms and Complexity (CIAC 2003), Rome, Italy, May
28-30, 2003, LNCS 2653, 2003, Springer, 152-164
- Miroslav Chlebík and Janka
Chlebíková, Approximation Hardness of the Steiner Tree Problem on
Graphs , Proc. of 8th Scandinavian Workshop on Algorithm
Theory (SWAT 2002), Turku, Finland, July 3-5, 2002, LNCS 2368,
2002, Springer, 170-179.
|
|
|
Mathematical conferences with
proceedings |
|
|
|
- Janka Chlebíková and Klaus Jansen, The d-precoloring problem on
k-degenerate graphs, Proc. of 2th European Conference on
Combinatorics, Graphs, and Applications (EUROCOMB 2003), Prag, September
8-12, 2003, 81-85.
- Janka Chlebíková, The structure of obstructions to treewidth and
pathwidth, Proc. of 6th Twente Workshop on graphs and combinatorial
optimization, University of Twente, May 26-28, 1999,
34-39.
|
|
Electronic publications (preprint
servers) |
|
|
|
- Miroslav Chlebík and Janka Chlebíková, Hardness of asymptotic approximation for
orthogonal rectangle packing and covering problems
, Electronic Colloquium on
Computational Complexity, Report No. 19, 2006.
- Miroslav Chlebík and Janka Chlebíková, Crown reductions for the
Minimum Weighted Vertex Cover problem, Electronic Colloquium on
Computational Complexity, Report No. 101, 2004.
- Miroslav Chlebík and Janka Chlebíková, Inapproximability results
for bounded variants of optimization problems, Electronic Colloquium
on Computational Complexity, Report No. 26, 2003.
- Miroslav Chlebík and Janka Chlebíková, Approximation Hardness
for Small Occurrence Instances of NP-Hard Problems,
Electronic Colloquium on Computational Complexity, Report No. 73,
2002.
|
|
Other publications (about electronic
publishing) |
|
|
|
- Jaroslav Guričan, Janka Chlebíková, Marek Nagy, and Igor Odrobina,
The Euromath System - a structured XML editor and browser, Proc.
of 12th European TEX Conference, Kerkrade: NTG, 2001, 41--48.
- Janka Chlebíková, The Euromath System - The Structured Editor for
Mathematicians, Proc. of 10th European TeX Conference, Saint
Malo, France, March 28-29, 1998, 82-93.
- Janka Chlebíková, Elektronické publikovanie a nové štandardy na
WWW, Sborník semináře Poškole 2001, Praha, ČVUT, ISBN 80-01-02364-8, 70-77 (in Slovak).
- Janka Chlebíková and Peter Olšák, Projekt TeXlive, Sborník
2.ročníku semináře o Linuxu a TEXu - SLT 2001, Praha: Konvoj, 2001,
12-22 (in Slovak).
- Janka Chlebíková, Čo je možné nájsť v knihe: Math Into
LaTeX, 2000 (3.vydanie), Spravodaj Československého združenia
užívateľov TeXu 4/01, 195-200 (in Slovak).
- Janka Chlebíková, TeXLive4 pod Windows so slovenčinou a
češtinou, Spravodaj Československého združenia užívateľov TeXu 4/99
(in Slovak).
- Janka Chlebíková, Odborný dokument pre TeX a Web, Spravodaj
Československého združenia užívateľov TeXu 3-4/98, 144-152 (in Slovak).
- Janka Chlebíková, Čo stojí za HTML a XML, Informatické listy
z MFF, máj 1998, 7-8 (in Slovak).
- Janka Chlebíková, Štrukturované editovanie, Spravodaj
Československého združenia užívateľov TeXu 4/97, 185-190 (in Slovak).
- Janka Chlebíková, O jednom trochu neklasickom textovom
editore, Informatické listy z MFF UK, 3/96, 8-10 (in Slovak).
- Janka Chlebíková, Užívateľský manuál k AmSTeXu, interná
publikácia MFF UK, 1992 (in Slovak).
- Janka Chlebíková, Nebojme sa nových fontov, Spravodaj
Československého združenia užívateľov TeXu 2/92, 53-59 (in
Slovak).
- Janka Chlebíková, Čo s matematickými diagramami a grafmi?
Spravodaj Československého združenia užívateľov TeXu 3/92, 111-122 (in
Slovak)
- Janka Chlebíková, Ako rozdeliť (slovo) Československo.
Spravodaj Československého združenia užívateľov TeXu 4/1991 (in Slovak)
- Janka Chlebíková, Interaktívne ovládanie driveru (DVISCR).
Spravodaj Československého združenia užívateľov TeXu 3/1991 (in
Slovak).
|
