BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Czech Republic
1 × Finland
1 × Germany
1 × Italy
1 × Japan
1 × Portugal
2 × Denmark
2 × Spain
2 × Switzerland
Collaborated with:
A.Czumaj M.Kowaluk L.Gasieniec M.M.Syslo T.Kovacs M.Karpinski D.Sledneu E.Lundell M.Christersson H.Zhao H.Olsson A.Östlin C.Levcopoulos J.Sack A.Adamaszek J.O.Wojtaszczyk J.Czyzowicz J.Jansson P.Zylinski
Talks about:
approxim (5) network (4) scheme (4) euclidean (3) polynomi (3) problem (3) geometr (3) connect (3) design (3) graph (3)

Person: Andrzej Lingas

DBLP DBLP: Lingas:Andrzej

Facilitated 1 volumes:

ICALP 1993Ed

Contributed to:

ICALP (1) 20152015
ICALP (1) 20112011
LATA 20112011
CIAA 20102011
ICALP 20052005
ICALP 20022002
ICALP 20002000
ICALP 19991999
ICALP 19981998
ICALP 19881988
ICALP 19871987
ICALP 19821982
ICALP 19781978

Wrote 15 papers:

ICALP-v1-2015-KarpinskiLS #set
A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set (MK, AL, DS), pp. 785–796.
ICALP-v1-2011-AdamaszekCLW #approximate #design #geometry #network
Approximation Schemes for Capacitated Geometric Network Design (AA, AC, AL, JOW), pp. 25–36.
Unique Small Subgraphs Are Not Easier to Find (MK, AL, EML), pp. 336–341.
CIAA-J-2010-CzumajCGJLZ11 #algorithm #approximate #design #geometry #network
Approximation Algorithms for Buy-at-Bulk Geometric Network Design (AC, JC, LG, JJ, AL, PZ), pp. 1949–1969.
ICALP-2005-KowalukL #graph #query
LCA Queries in Directed Acyclic Graphs (MK, AL), pp. 241–248.
ICALP-2002-ChristerssonGL #ad hoc #bound #network
Gossiping with Bounded Size Messages in ad hoc Radio Networks (MC, LG, AL), pp. 377–389.
ICALP-2002-CzumajLZ #approximate #design #network #polynomial #problem
Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem (AC, AL, HZ), pp. 973–984.
ICALP-2000-CzumajL #approximate #multi #performance #problem
Fast Approximation Schemes for Euclidean Multi-connectivity Problems (AC, AL), pp. 856–868.
ICALP-1999-LingasOO #maintenance #performance
Efficient Merging, Construction, and Maintenance of Evolutionary Trees (AL, HO, ), pp. 544–553.
ICALP-1998-CzumajL #approximate #polynomial
A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity (AC, AL), pp. 682–694.
ICALP-1988-LingasS #algorithm #graph #morphism #polynomial
A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs (AL, MMS), pp. 394–409.
ICALP-1987-LevcopoulosLS #geometry #heuristic
Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (CL, AL, JRS), pp. 376–385.
ICALP-1982-Lingas #power of
The Power of Non-Rectilinear Holes (AL), pp. 369–383.
ICALP-1978-Lingas #game studies #problem
A PSPACE Complete Problem Related to a Pebble Game (AL), pp. 300–321.
TAPSOFT-1997-KovacL #graph
Maximum Packing for Biconnected Outerplanar Graphs (TK, AL), pp. 393–404.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.