Author of the publication

Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings.

, , , , and . WG, volume 5344 of Lecture Notes in Computer Science, page 90-100. (2008)

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

Smooth movement and Manhattan path based Random Waypoint mobility., , , , , and . Inf. Process. Lett., 111 (5): 239-246 (2011)Moving Beyond the Twitter Follow Graph., , , , , , , , and . KDIR, page 612-619. SciTePress, (2015)Optimal covering designs: complexity results and new bounds., , and . Discrete Applied Mathematics, 144 (3): 281-290 (2004)On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs., , , , and . STACS, volume 2010 of Lecture Notes in Computer Science, page 121-131. Springer, (2001)Estimation of distance-based metrics for very large graphs with MinHash Signatures., , , , and . BigData, page 536-545. IEEE Computer Society, (2017)Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings., , , , and . WG, volume 5344 of Lecture Notes in Computer Science, page 90-100. (2008)On the Complexity of Approximating Colored-Graph Problems., , and . COCOON, volume 1627 of Lecture Notes in Computer Science, page 281-290. Springer, (1999)Text Sparsification via Local Maxima., , , , , and . FSTTCS, volume 1974 of Lecture Notes in Computer Science, page 290-301. Springer, (2000)Synchronous context-free grammars and optimal linear parsing strategies., , , , and . J. Comput. Syst. Sci., 81 (7): 1333-1356 (2015)Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies., , , , and . CoRR, (2013)