( en | de | ru )

 

Disambiguation of "Lingas, Andrzej"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient broadcasting in radio networks with long-range interference.

, , and . Distributed Comput., 26 (1): 59-74 (2013)

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 Szczerbakow

Andrzej Szplit

Andrzej Tamborek

 

Other publications of authors with the same name

The do-all problem in broadcast networks., , and . PODC, page 117-127. ACM, (2001)Efficient Algorithms for Subgraph Listing., and . Algorithms, 7 (2): 243-252 (2014)Clearing directed subgraphs by mobile agents: Variations on covering with paths., , , , and . J. Comput. Syst. Sci., (2019)Detecting and Counting Small Pattern Graphs., , , and . ISAAC, volume 8283 of Lecture Notes in Computer Science, page 547-557. Springer, (2013)On the Power of Nonconservative PRAM., and . MFCS, volume 1113 of Lecture Notes in Computer Science, page 303-311. Springer, (1996)A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity., and . ICALP, volume 1443 of Lecture Notes in Computer Science, page 682-694. Springer, (1998)The Power of Non-Rectilinear Holes.. ICALP, volume 140 of Lecture Notes in Computer Science, page 369-383. Springer, (1982)LCA Queries in Directed Acyclic Graphs., and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 241-248. Springer, (2005)Clearing Connections by Few Agents., , , and . FUN, volume 8496 of Lecture Notes in Computer Science, page 289-300. Springer, (2014)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)