( en | de | ru )

 

Disambiguation of "Czumaj, Artur"

Author of the publication

copydeleteadd this publication to your clipboard
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs.

, , , and . ESA, volume 3669 of Lecture Notes in Computer Science, page 472-483. Springer, (2005)

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.

Artur Czumaj

Artur Kühn

Artur Lippmann

Artur Botta

Artur Koch

 

Other publications of authors with the same name

An $O(k)$-Competitive Algorithm for Generalized Caching, , , and . SODA, page 1681--1689. SIAM, (2012)Minimum k-Connected Geometric Networks., and . Encyclopedia of Algorithms, (2016)Almost Optimal Deterministic Broadcast in Radio Networks., and . CoRR, (2015)An Optimal Parallel Algorithm for Computing a Near-Optimal Order of Matrix Multiplications.. SWAT, volume 621 of Lecture Notes in Computer Science, page 62-72. Springer, (1992)On the Complexity of Determining the Period of a String., and . CPM, volume 1848 of Lecture Notes in Computer Science, page 412-422. Springer, (2000)Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs., and . ICALP, volume 700 of Lecture Notes in Computer Science, page 88-101. Springer, (1993)On the expected payment of mechanisms for task allocation: extended abstract., and . EC, page 252-253. ACM, (2004)Minimum k-Connected Geometric Networks., and . Encyclopedia of Algorithms, Springer, (2008)Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks., and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 220-231. Springer, (2007)Distributed Methods for Computing Approximate Equilibria., , , , , and . Algorithmica, 81 (3): 1205-1231 (2019)