Author of the publication

Interval degree and bandwidth of a graph.

, and . Discrete Applied Mathematics, 129 (2-3): 345-359 (2003)

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

Complexity of approximating the oriented diameter of chordal graphs., , and . Journal of Graph Theory, 45 (4): 255-269 (2004)Intractability of Clique-Width Parameterizations., , , and . SIAM J. Comput., 39 (5): 1941-1956 (2010)Algorithmic Lower Bounds for Problems Parameterized with Clique-Width., , , and . SODA, page 493-502. SIAM, (2010)Parameterized complexity of firefighting., , , , , and . J. Comput. Syst. Sci., 80 (7): 1285-1297 (2014)Local search: Is brute-force avoidable?, , , , , and . J. Comput. Syst. Sci., 78 (3): 707-719 (2012)Parameterized complexity of connected even/odd subgraph problems., and . J. Comput. Syst. Sci., 80 (1): 157-179 (2014)Branch and Recharge: Exact Algorithms for Generalized Domination., , , , and . Algorithmica, 61 (2): 252-273 (2011)Sharp Separation and Applications to Exact and Parameterized Algorithms., , , and . Algorithmica, 63 (3): 692-706 (2012)Pursuing a fast robber on a graph., , , , and . Theor. Comput. Sci., 411 (7-9): 1167-1181 (2010)Solving Connected Dominating Set Faster than 2 n ., , and . Algorithmica, 52 (2): 153-166 (2008)