( en | de | ru )

 

Disambiguation of "Lingas, Andrzej"

Author of the publication

copydeleteadd this publication to your clipboard
A QPTAS for the Base of the Number of Triangulations of a Planar Point Set.

, , and . CoRR, (2014)

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.

Andrzej Lingas

Andrzej Debski

Andrzej Piotrowski

Andrzej Bachry

Andrzej Ancygier

 

Other publications of authors with the same name

The do-all problem in broadcast networks., , and . PODC, page 117-127. ACM, (2001)Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems., , and . Algorithmica, 64 (2): 295-310 (2012)On the Power of Nonconservative PRAM., and . MFCS, volume 1113 of Lecture Notes in Computer Science, page 303-311. Springer, (1996)Clearing Connections by Few Agents., , , and . FUN, volume 8496 of Lecture Notes in Computer Science, page 289-300. Springer, (2014)Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs., , , and . FSTTCS, volume 472 of Lecture Notes in Computer Science, page 204-214. Springer, (1990)A Path Cover Technique for LCAs in Dags., , and . SWAT, volume 5124 of Lecture Notes in Computer Science, page 222-233. Springer, (2008)Fast Algorithms for Greedy Triangulation., and . SWAT, volume 447 of Lecture Notes in Computer Science, page 238-250. Springer, (1990)Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs., , , and . AAIM, volume 4508 of Lecture Notes in Computer Science, page 337-345. Springer, (2007)Trade-Offs Between Load and Degree in Virtual Path Layouts., , and . Parallel Process. Lett., 13 (3): 485-496 (2003)Detecting and Counting Small Pattern Graphs., , , and . ISAAC, volume 8283 of Lecture Notes in Computer Science, page 547-557. Springer, (2013)