Andrzej Lingas
51 – 100 of 131
- show: 50
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2014
-
Mark
Iterative merging heuristics for correlation clustering
(
- Contribution to journal › Article
-
Mark
3D Rectangulations and Geometric Matrix Multiplication
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Clearing Connections by Few Agents
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Simple Iterative Heuristics for Correlation Clustering
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems.
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Efficiently Correcting Matrix Products
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2013
-
Mark
Counting and Detecting Small Subgraphs via Equations
(
- Contribution to journal › Article
-
Mark
Detecting and Counting Small Pattern Graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Efficient broadcasting in radio networks with long-range interference
(
- Contribution to journal › Article
-
Mark
Towards more efficient infection and fire fighting
(
- Contribution to journal › Article
-
Mark
Unique subgraphs are not easier to find
(
- Contribution to journal › Article
-
Mark
Optimal cuts and partitions in tree metrics in polynomial time
(
- Contribution to journal › Article
- 2012
-
Mark
Linear-time 3-approximation algorithm for the r-star covering problem
(
- Contribution to journal › Article
-
Mark
A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Exact and approximation algorithms for geometric and capacitated set cover problems
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
An Approximation Algorithm for Directed Shallow Steiner Trees
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
The complexity of inferring a minimally resolved phylogenetic supertree
(
- Contribution to journal › Article
- 2011
-
Mark
Approximation algorithms for buy-at-bulk geometric network design
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
(
- Contribution to journal › Article
- 2010
-
Mark
PTAS for k-tour cover poblem on the plane for moderately large values of k
(
- Contribution to journal › Article
-
Mark
Approximability of edge matching puzzles
2010) 36th International Conference on Current Trends in Theory and Practice of Computer Science 5901. p.153-164(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2009
-
Mark
Faster multi-witnesses for Boolean matrix multiplication
(
- Contribution to journal › Article
-
Mark
Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication
(
- Contribution to journal › Article
-
Mark
A fast output-sensitive algorithm for Boolean matrix multiplication
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
PTAS for k-tour cover poblem on the plane for moderately large values of k
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Efficient approximation algorithms for shortest cycles in undirected graphs
(
- Contribution to journal › Article
-
Mark
An exact algorithm for subgraph homeomorphism
(
- Contribution to journal › Article
-
Mark
Efficient broadcasting in known toplogy radio networks with long-range interference
2009) p.230-239(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2008
-
Mark
A path cover technique for LCAs in dags
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Minimum k-connected geometric networks
2008) p.536-538(
- Chapter in Book/Report/Conference proceeding › Book chapter
-
Mark
Linear-time 3-approximation algorithm for the r-star covering problem
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Approximate clustering of incomplete fingerprints
(
- Contribution to journal › Article
-
Mark
Max-stretch reduction for tree spanners
(
- Contribution to journal › Article
-
Mark
Efficient approximation algorithms for shortest cycles in undirected graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2007
-
Mark
Unique lowest common ancestors in dags are almost as easy as matrix multiplication
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Note on covering monotone orthogonal polygons with star-shaped polygons
(
- Contribution to journal › Article
-
Mark
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
(
- Contribution to journal › Article
-
Mark
Embedding point sets into plane graphs of small dilation
(
- Contribution to journal › Article
-
Mark
Approximating the maximum clique minor and some subgraph homeomorphism problems.
(
- Contribution to journal › Article
-
Mark
On exact complexity of subgraph homeomorphism
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Approximating the maximum independent set and minimum vertex coloring on box graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Finding a heaviest triangle is not harder than matrix multiplication
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Polynomial-time algorithms for the ordered maximum agreement subtree problem
(
- Contribution to journal › Article
-
Mark
On the approximability of maximum and minimum edge clique partition problems
(
- Contribution to journal › Article
- 2006
-
Mark
A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation
(
- Contribution to journal › Article
-
Mark
On the approximability of maximum and minimum edge clique partition problems
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Finding a heaviest triangle is no harder than matrix multiplication
2006) In Electronic Colloquium on Computational Complexity(
- Book/Report › Report
-
Mark
Minimum-energy broadcasting in wireless networks in the d-dimensional Euclidean space (the alpha
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Performing work in broadcast networks
(
- Contribution to journal › Article