Author of the publication

Panarity, Revisited (Extended Abstract).

, , and . WADS, volume 1272 of Lecture Notes in Computer Science, page 472-473. Springer, (1997)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Recognizing Hole-Free 4-Map Graphs in Cubic Time., , and . Algorithmica, 45 (2): 227-262 (2006)Tight upper bound on the number of edges in a bipartite K3, 3-free or K5-free graph with an application., and . Inf. Process. Lett., 84 (3): 141-145 (2002)Better Practical Algorithms for rSPR Distance and Hybridization Number., , and . WABI, volume 143 of LIPIcs, page 5:1-5:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem., , , , and . Algorithmica, 81 (11-12): 4167-4199 (2019)Hierarchical Topological Inference on Planar Disc Maps., and . COCOON, volume 1858 of Lecture Notes in Computer Science, page 115-125. Springer, (2000)Optimizing deletion cost for secure multicast key management., , , and . Theor. Comput. Sci., 401 (1-3): 52-61 (2008)Efficient Algorithms for Acyclic Colorings of Graphs.. Theor. Comput. Sci., 230 (1-2): 75-95 (2000)On the Complexity of Computing Optimal Solutions., and . Int. J. Found. Comput. Sci., 2 (3): 207-220 (1991)A Fast and Efficient Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Formula.. Inf. Process. Lett., 43 (4): 191-193 (1992)Finding Double Euler Trails of Planar Graphs in Linear Time., , and . SIAM J. Comput., 31 (4): 1255-1285 (2002)