Author of the publication

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

Tight Approximability of the Server Allocation Problem for Real-Time Applications., , , , , and . ALGOCLOUD, volume 10739 of Lecture Notes in Computer Science, page 41-55. Springer, (2017)Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams., , , , , , , , and . ACM Trans. Algorithms, 19 (1): 6:1-6:22 (January 2023)Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs., , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 105-A (9): 1211-1222 (September 2022)Algorithms for Finding Distance-Edge-Colorings of Graphs., , , and . COCOON, volume 3595 of Lecture Notes in Computer Science, page 798-807. Springer, (2005)Complexity of Reconfiguration Problems for Constraint Satisfaction., , and . CoRR, (2018)Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size., , and . WG, volume 3353 of Lecture Notes in Computer Science, page 365-376. Springer, (2004)Incremental Optimization of Independent Sets under Reachability Constraints., , , and . CoRR, (2018)Parameterizing Cut Sets in a Graph by the Number of Their Components., , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 605-615. Springer, (2009)Minimum-Cost b-Edge Dominating Sets on Trees., , , , and . Algorithmica, 81 (1): 343-366 (2019)Swapping labeled tokens on graphs., , , , , , , , , and . Theor. Comput. Sci., (2015)