Author of the publication

Optimal Listing of Cycles and St-paths in Undirected Graphs

, , , , , , and . Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, page 1884--1896. SIAM, (2013)

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

König's Edge Coloring Theorem without Augmenting Paths. Journal of Graph Theory, 29 (2): 87--87 (1998)A Short Proof of König's Matching Theorem. Journal of Graph Theory, 33 (3): 138--139 (2000)The Minimum Substring Cover Problem., , , and . WAOA, volume 4927 of Lecture Notes in Computer Science, page 170-183. Springer, (2007)Optimal Listing of Cycles and St-paths in Undirected Graphs, , , , , , and . Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, page 1884--1896. SIAM, (2013)Hybrid SAT-Based Consistency Checking Algorithms for Simple Temporal Networks with Decisions., , , and . TIME, volume 147 of LIPIcs, page 16:1-16:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Packing cycles in undirected graphs., , and . J. Algorithms, 48 (1): 239-256 (2003)Friendly bin packing instances without Integer Round-up Property., , , , and . Math. Program., 150 (1): 5-17 (2015)Online Permutation Routing in Partitioned Optical Passive Star Networks., and . IEEE Trans. Computers, 55 (12): 1557-1571 (2006)On the Trade-Off between Energy and Multicast Efficiency in 802.16e-Like Mobile Networks., , and . IEEE Trans. Mob. Comput., 7 (3): 346-357 (2008)Ranking, unranking and random generation of extensional acyclic digraphs., and . Inf. Process. Lett., 113 (5-6): 183-187 (2013)