Author of the publication

Listing Subgraphs by Cartesian Decomposition.

, , , , and . MFCS, volume 117 of LIPIcs, page 84:1-84:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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

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)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)Faster FPTASes for counting and random generation of Knapsack solutions., and . Inf. Comput., (2019)Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty., , and . TIME, volume 120 of LIPIcs, page 8:1-8:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Optimal Omnitig Listing for Safe and Complete Contig Assembly., , , , and . CPM, volume 78 of LIPIcs, page 29:1-29:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Evaluation of BIC-based algorithms for audio segmentation., , and . Comput. Speech Lang., 19 (2): 147-170 (2005)Routing permutations in Partitioned Optical Passive Stars Networks., and . J. Parallel Distributed Comput., 63 (9): 847-852 (2003)