![PDF) The black-and-white coloring problem on distance hereditary graphs and strongly chordal graphs | ton kloks - Academia.edu PDF) The black-and-white coloring problem on distance hereditary graphs and strongly chordal graphs | ton kloks - Academia.edu](https://0.academia-photos.com/attachment_thumbnails/46635639/mini_magick20190209-21179-1n1ycwq.png?1549719863)
PDF) The black-and-white coloring problem on distance hereditary graphs and strongly chordal graphs | ton kloks - Academia.edu
![Ton KLOKS | National Tsing Hua University, Hsinchu | NTHU | Department of Computer Science | Research profile Ton KLOKS | National Tsing Hua University, Hsinchu | NTHU | Department of Computer Science | Research profile](https://www.researchgate.net/profile/Ton-Kloks/publication/220789097/figure/fig2/AS:655142961557530@1533209662770/A-3-sun-in-which-one-independent-set-vertex-and-one-clique-vertex-are-the-only_Q320.jpg)
Ton KLOKS | National Tsing Hua University, Hsinchu | NTHU | Department of Computer Science | Research profile
![Treewidth: Computations and Approximations / Edition 1 by Ton Kloks | 9783540583561 | Paperback | Barnes & Noble® Treewidth: Computations and Approximations / Edition 1 by Ton Kloks | 9783540583561 | Paperback | Barnes & Noble®](http://prodimage.images-bn.com/pimages/9783540583561_p0_v2_s1200x630.jpg)
Treewidth: Computations and Approximations / Edition 1 by Ton Kloks | 9783540583561 | Paperback | Barnes & Noble®
![Treewidth: Computations and Approximations (Lecture Notes in Computer Science, 842): Kloks, Ton: 9783540583561: Amazon.com: Books Treewidth: Computations and Approximations (Lecture Notes in Computer Science, 842): Kloks, Ton: 9783540583561: Amazon.com: Books](https://m.media-amazon.com/images/I/61egZVDrdzL._AC_UF1000,1000_QL80_.jpg)
Treewidth: Computations and Approximations (Lecture Notes in Computer Science, 842): Kloks, Ton: 9783540583561: Amazon.com: Books
![PDF) Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph | ton kloks - Academia.edu PDF) Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph | ton kloks - Academia.edu](https://0.academia-photos.com/attachment_thumbnails/46635675/mini_magick20190209-17909-1iu01pu.png?1549719879)
PDF) Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph | ton kloks - Academia.edu
![Ton KLOKS | National Tsing Hua University, Hsinchu | NTHU | Department of Computer Science | Research profile Ton KLOKS | National Tsing Hua University, Hsinchu | NTHU | Department of Computer Science | Research profile](https://www.researchgate.net/publication/314488370/figure/fig1/AS:962644316004353@1606523698783/The-cotrees-for-G-and-H-used-in-the-proof-of-Theorem26-a-Cotree_Q320.jpg)
Ton KLOKS | National Tsing Hua University, Hsinchu | NTHU | Department of Computer Science | Research profile
![Advances in Graph Algorithms - Free Computer, Programming, Mathematics, Technical Books, Lecture Notes and Tutorials Advances in Graph Algorithms - Free Computer, Programming, Mathematics, Technical Books, Lecture Notes and Tutorials](https://freecomputerbooks.com/covers/Advances-in-Graph-Algorithms.png)
Advances in Graph Algorithms - Free Computer, Programming, Mathematics, Technical Books, Lecture Notes and Tutorials
![Treewidth: Computations and Approximations (Lecture Notes in Computer Science, 842): Kloks, Ton: 9783540583561: Amazon.com: Books Treewidth: Computations and Approximations (Lecture Notes in Computer Science, 842): Kloks, Ton: 9783540583561: Amazon.com: Books](https://m.media-amazon.com/images/I/61Od3XsF6NL._AC_UF1000,1000_QL80_.jpg)
Treewidth: Computations and Approximations (Lecture Notes in Computer Science, 842): Kloks, Ton: 9783540583561: Amazon.com: Books
![Ton KLOKS | National Tsing Hua University, Hsinchu | NTHU | Department of Computer Science | Research profile Ton KLOKS | National Tsing Hua University, Hsinchu | NTHU | Department of Computer Science | Research profile](https://www.researchgate.net/profile/Ton-Kloks/publication/220587844/figure/fig1/AS:305455730577409@1449837729428/A-graph-G-1_Q320.jpg)
Ton KLOKS | National Tsing Hua University, Hsinchu | NTHU | Department of Computer Science | Research profile
![Ton KLOKS | National Tsing Hua University, Hsinchu | NTHU | Department of Computer Science | Research profile Ton KLOKS | National Tsing Hua University, Hsinchu | NTHU | Department of Computer Science | Research profile](https://www.researchgate.net/profile/Ton-Kloks/publication/227085293/figure/fig2/AS:393725005058049@1470882764105/Matching-diagram-for-vertices-in-permutation-graph-in-the-proof-of-Claim-21_Q320.jpg)
Ton KLOKS | National Tsing Hua University, Hsinchu | NTHU | Department of Computer Science | Research profile
![Ton KLOKS | National Tsing Hua University, Hsinchu | NTHU | Department of Computer Science | Research profile Ton KLOKS | National Tsing Hua University, Hsinchu | NTHU | Department of Computer Science | Research profile](https://www.researchgate.net/profile/Ton-Kloks/publication/228961759/figure/fig1/AS:669402810822686@1536609475778/an-interval-collection-given-by-their-normalized-model_Q320.jpg)
Ton KLOKS | National Tsing Hua University, Hsinchu | NTHU | Department of Computer Science | Research profile
![PDF) New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs PDF) New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs](https://i1.rgstatic.net/publication/220752622_New_Algorithms_for_k-Face_Cover_k-Feedback_Vertex_Set_and_k-Disjoint_Cycles_on_Plane_and_Planar_Graphs/links/55d42b8908ae0b8f3ef938c2/largepreview.png)