The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ton Kloks: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng
    Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:267-278 [Conf]
  2. Maw-Shang Chang, Ton Kloks, Dieter Kratsch, Jiping Liu, Sheng-Lung Peng
    On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:808-817 [Conf]
  3. Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks
    Complexity Aspects of Map Compression. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1991, pp:287-296 [Conf]
  4. Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch
    Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:260-271 [Conf]
  5. Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch
    Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:508- [Conf]
  6. Ton Kloks, Dieter Kratsch, Haiko Müller
    Approximating the Bandwidth for Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:434-447 [Conf]
  7. Hans L. Bodlaender, Ton Kloks
    Better Algorithms for the Pathwidth and Treewidth of Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:544-555 [Conf]
  8. Hans L. Bodlaender, Ton Kloks, Dieter Kratsch
    Treewidth and Pathwidth of Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:114-125 [Conf]
  9. Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
    Independent Sets in Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:760-770 [Conf]
  10. Ton Kloks, Dieter Kratsch, C. K. Wong
    Minimum Fill-In on Circle and Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:256-267 [Conf]
  11. Ton Kloks
    Treewidth of Circle Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:108-117 [Conf]
  12. Ton Kloks, Hans L. Bodlaender
    Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:116-125 [Conf]
  13. Ton Kloks, Haiko Müller, C. K. Wong
    Vertex Ranking of Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:174-182 [Conf]
  14. Sheng-Lung Peng, Ton Kloks, Chuan-Min Lee
    The Maximum Interval Graphs on Distance Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    JCIS, 2006, pp:- [Conf]
  15. Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra
    Degree-Preserving Forests. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:713-721 [Conf]
  16. X. Cai, Ton Kloks, C. K. Wong
    Shortest Path Problems with Time Constraints. [Citation Graph (0, 0)][DBLP]
    MFCS, 1996, pp:255-266 [Conf]
  17. Hans L. Bodlaender, Ton Kloks
    A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:415-423 [Conf]
  18. Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen
    lambda-Coloring of Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:395-406 [Conf]
  19. Gerard Jennhwa Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng
    The PIGs Full Monty - A Floor Show of Minimal Separators. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:521-532 [Conf]
  20. Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller
    On Vertex Ranking for Permutations and Other Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:747-758 [Conf]
  21. Ton Kloks, Dieter Kratsch
    Treewidth of Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:80-89 [Conf]
  22. Ton Kloks, Dieter Kratsch
    Finding All Minimal Separators of a Graph. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:759-768 [Conf]
  23. Ton Kloks, Jan Kratochvíl, Haiko Müller
    New Branchwidth Territories. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:173-183 [Conf]
  24. Ton Kloks, Hans L. Bodlaender
    Testing Superperfection of k-Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:292-303 [Conf]
  25. Hans L. Bodlaender, Celina M. Herrera de Figueiredo, Marisa Gutierrez, Ton Kloks, Rolf Niedermeier
    Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P4's. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:87-99 [Conf]
  26. Hajo Broersma, Elias Dahlhaus, Ton Kloks
    Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:109-117 [Conf]
  27. Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
    A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:88-99 [Conf]
  28. Maw-Shang Chang, Ton Kloks, Chuan-Min Lee
    Maximum Clique Transversals. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:32-43 [Conf]
  29. Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza
    Ranking of Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:292-304 [Conf]
  30. Hans L. Bodlaender, John R. Gilbert, Ton Kloks, Hjálmtyr Hafsteinsson
    Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height. [Citation Graph (0, 0)][DBLP]
    WG, 1991, pp:1-12 [Conf]
  31. David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng
    Partitioned Probe Comparability Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:179-190 [Conf]
  32. Jirí Fiala, Ton Kloks, Jan Kratochvíl
    Fixed-Parameter Complexity of lambda-Labelings. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:350-363 [Conf]
  33. Ton Kloks, Dieter Kratsch, Yvan Le Borgne, Haiko Müller
    Bandwidth of Split and Circular Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:243-254 [Conf]
  34. Ton Kloks, Dieter Kratsch, Haiko Müller
    Dominoes. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:106-120 [Conf]
  35. Ton Kloks, Dieter Kratsch, Haiko Müller
    Finding and Counting Small Induced Subgraphs Efficiently. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:14-23 [Conf]
  36. Ton Kloks, Dieter Kratsch, Haiko Müller
    Asteroidal Sets in Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:229-241 [Conf]
  37. Ton Kloks, Chuan-Min Lee, Jiping Liu
    New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:282-295 [Conf]
  38. Ton Kloks, Chuan-Min Lee, Jiping Liu, Haiko Müller
    On the Recognition of General Partition Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:273-283 [Conf]
  39. Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng
    Roman Domination over Some Graph Classes. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:103-114 [Conf]
  40. Jochen Alber, Hans L. Bodlaender, Henning Fernau, Ton Kloks, Rolf Niedermeier
    Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:4, pp:461-493 [Journal]
  41. Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
    A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:4, pp:594-610 [Journal]
  42. Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen
    Approximations for lambda-Colorings of Graphs. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2004, v:47, n:2, pp:193-204 [Journal]
  43. Hajo Broersma, Elias Dahlhaus, Ton Kloks
    A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:99, n:1-3, pp:367-400 [Journal]
  44. Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller
    On the Vertex Ranking Problem for Trapezoid, Circular-arc and Other Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:98, n:1-2, pp:39-63 [Journal]
  45. Jirí Fiala, Ton Kloks, Jan Kratochvíl
    Fixed-parameter complexity of lambda-labelings. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:1, pp:59-72 [Journal]
  46. Ton Kloks, Jan Kratochvíl, Haiko Müller
    Computing the branchwidth of interval graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:266-275 [Journal]
  47. Ton Kloks, Richard B. Tan
    Bandwidth and topological bandwidth of graphs with few P4's. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:117-133 [Journal]
  48. Dieter Kratsch, Ton Kloks, Haiko Müller
    Measuring the Vulnerability for Classes of Intersection Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:77, n:3, pp:259-270 [Journal]
  49. Ton Kloks, Dieter Kratsch, Chuan-Min Lee, Jiping Liu
    Improved bottleneck domination algorithms. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:11, pp:1578-1592 [Journal]
  50. Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu
    Efficient algorithms for graphs with few P4's. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:29-51 [Journal]
  51. Ton Kloks, Dieter Kratsch, Haiko Müller
    On the Structure of Graphs with Bounded Asteroidal Number. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:2, pp:295-306 [Journal]
  52. Ton Kloks
    Treewidth of Circle Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1996, v:7, n:2, pp:111-120 [Journal]
  53. Aart Blokhuis, Ton Kloks
    On the Equivalence Covering Number of Splitgraphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:54, n:5, pp:301-304 [Journal]
  54. Ton Kloks
    K_1, 3-Free and W_4-Free Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:60, n:4, pp:221-223 [Journal]
  55. Ton Kloks, Dieter Kratsch
    Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:55, n:1, pp:11-16 [Journal]
  56. Ton Kloks, Dieter Kratsch, Haiko Müller
    Finding and counting small induced subgraphs efficiently. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:3-4, pp:115-121 [Journal]
  57. Ton Kloks, Dieter Kratsch, Haiko Müller
    Bandwidth of Chain Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:68, n:6, pp:313-315 [Journal]
  58. Ton Kloks, Haiko Müller, C. K. Wong
    Vertex Ranking of Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:68, n:4, pp:201-206 [Journal]
  59. Hans L. Bodlaender, John R. Gilbert, Hjálmtyr Hafsteinsson, Ton Kloks
    Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:18, n:2, pp:238-255 [Journal]
  60. Hans L. Bodlaender, Ton Kloks
    A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:15, n:1, pp:160-172 [Journal]
  61. Hans L. Bodlaender, Ton Kloks
    Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:2, pp:358-402 [Journal]
  62. Ton Kloks, Dieter Kratsch
    Treewidth of Chordal Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:2, pp:266-281 [Journal]
  63. Ton Kloks, Dieter Kratsch, Haiko Müller
    Approximating the Bandwidth for Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:32, n:1, pp:41-57 [Journal]
  64. Ton Kloks, Dieter Kratsch, C. K. Wong
    Minimum Fill-in on Circle and Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:28, n:2, pp:272-289 [Journal]
  65. Gregory Gutin, Ton Kloks, Chuan-Min Lee, Anders Yeo
    Kernels in planar digraphs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:71, n:2, pp:174-184 [Journal]
  66. Hans L. Bodlaender, Ton Kloks, Dieter Kratsch, Haiko Müller
    Treewidth and Minimum Fill-in on d-Trapezoid Graphs. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1998, v:2, n:2, pp:- [Journal]
  67. Ton Kloks, Chuan-Min Lee, Jiping Liu
    Stickiness, Edge-Thickness, and Clique-Thickness in Graphs. [Citation Graph (0, 0)][DBLP]
    J. Inf. Sci. Eng., 2004, v:20, n:2, pp:207-217 [Journal]
  68. Hajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller
    Degree-preserving trees. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:35, n:1, pp:26-39 [Journal]
  69. X. Cai, Ton Kloks, C. K. Wong
    Time-varying shortest path problems with constraints. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:3, pp:141-150 [Journal]
  70. Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks
    Complexity Aspects of Two-Dimensional Data Compression. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1995, v:2, n:4, pp:462-495 [Journal]
  71. Ton Kloks, Dieter Kratsch
    Listing All Minimal Separators of a Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:3, pp:605-613 [Journal]
  72. Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza
    Rankings of Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:1, pp:168-181 [Journal]
  73. Hans L. Bodlaender, Ton Kloks, Dieter Kratsch
    Treewidth and Pathwidth of Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:4, pp:606-616 [Journal]
  74. Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
    Independent Sets in Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:2, pp:276-287 [Journal]
  75. Ton Kloks, Dieter Kratsch, Jeremy Spinrad
    On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:175, n:2, pp:309-335 [Journal]
  76. David B. Chandler, Jiong Guo, Ton Kloks, Rolf Niedermeier
    Probe Matrix Problems: Totally Balanced Matrices. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:368-377 [Conf]
  77. Ton Kloks
    An infinite sequence of GammaDelta-regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:73, n:1-2, pp:127-132 [Journal]

  78. Probe Ptolemaic Graphs. [Citation Graph (, )][DBLP]


  79. Classifying Rankwidth k-DH-Graphs. [Citation Graph (, )][DBLP]


  80. Block-Graph Width. [Citation Graph (, )][DBLP]


  81. On Some Simple Widths. [Citation Graph (, )][DBLP]


  82. Trivially-Perfect Width. [Citation Graph (, )][DBLP]


  83. Efficient algorithms for Roman domination on some classes of graphs. [Citation Graph (, )][DBLP]


  84. On probe permutation graphs. [Citation Graph (, )][DBLP]


Search in 0.042secs, Finished in 0.045secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002