Andrzej Lingas
Titel
professor
Organisation
046-2224519
Andrzej [dot] Lingas [at] cs [dot] lth [dot] se
Publikationer (hämtat ur Lunds universitets publikationsdatabas)
författare
- 2013
- 2012
- A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs
- Exact and approximation algorithms for geometric and capacitated set cover problems
- Linear-time 3-approximation algorithm for the r-star covering problem
- The complexity of inferring a minimally resolved phylogenetic supertree
- 2011
- 2010
- 2009
- A fast output-sensitive algorithm for Boolean matrix multiplication
- An exact algorithm for subgraph homeomorphism
- Efficient approximation algorithms for shortest cycles in undirected graphs
- Efficient broadcasting in known toplogy radio networks with long-range interference
- Faster multi-witnesses for Boolean matrix multiplication
- Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication
- PTAS for k-tour cover poblem on the plane for moderately large values of k
- 2008
- A path cover technique for LCAs in dags
- Approximate clustering of incomplete fingerprints
- Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
- Efficient approximation algorithms for shortest cycles in undirected graphs
- Linear-time 3-approximation algorithm for the r-star covering problem
- Max-stretch reduction for tree spanners
- Minimum k-connected geometric networks
- 2007
- Approximating the maximum clique minor and some subgraph homeomorphism problems.
- Approximating the maximum independent set and minimum vertex coloring on box graphs
- Embedding point sets into plane graphs of small dilation
- Faster algorithms for finding lowest common ancestors in directed acyclic graphs
- Finding a heaviest triangle is not harder than matrix multiplication
- Note on covering monotone orthogonal polygons with star-shaped polygons
- On exact complexity of subgraph homeomorphism
- On the approximability of maximum and minimum edge clique partition problems
- Polynomial-time algorithms for the ordered maximum agreement subtree problem
- Unique lowest common ancestors in dags are almost as easy as matrix multiplication
- 2006
- A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation
- Finding a heaviest triangle is no harder than matrix multiplication
- Minimum-energy broadcasting in wireless networks in the d-dimensional Euclidean space (the alpha<=d case).
- On the approximability of maximum and minimum edge clique partition problems
- Performing work in broadcast networks
- 2005
- A note on maximum independent set and related problems on box graphs
- Approximate clustering of fingerprint vectors with missing values
- Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
- Embedding point sets into plane graphs of small dilation
- LCA queries in directed acyclic graphs
- Max-stretch reduction for tree spanners
- Polynomial time approximation schemes for max-bisection on planar and geometric graphs
- 2004
- A fast algorithm for approximating the detour of a polygonal chain
- Approximation algorithms for Hamming clustering problems
- Approximation algorithms for MAX-BISECTION on low degree regular graphs
- Polynomial-time algorithms for the ordered maximum agreement subtree problem
- Subexponential-time framework for optimal embeddings of graphs in integer lattices
- 2003
- A fast algorithm for optimal alignment between similar ordered trees
- An improved bound on Boolean matrix multiplication for highly clustered data
- Improved approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
- Subexponential-time algorithms for maximum independent set and related problems on box graphs
- Trade-offs between load and degree in virtual path layouts
- 2002
- A geometric approach to Boolean matrix multiplication
- Adaptive algorithms for constructing convex hulls and triangulations of polygonal chains
- Approximation algorithms for time-dependent orienteering
- Gossiping with bounded size messages in ad hoc radio networks (Extended abstract)
- On adaptive deterministic gossiping in ad hoc radio networks
- On adaptive deterministic gossiping in ad hoc radio networks
- Polynomial-time approximation schemes for the Euclidean survivable network design problem
- 2001
- 2000
- 1981
- 1979
- 1978
redaktör
- 2003
