The following pages link to Andrzej Lingas (Q293198):
Displayed 50 items.
- Extreme witnesses and their applications (Q1799232) (← links)
- Subgraph isomorphism for biconnected outerplanar graphs in cubic time (Q1823708) (← links)
- Approximation algorithms for time-dependent orienteering. (Q1853044) (← links)
- On adaptive deterministic gossiping in ad hoc radio networks. (Q1853048) (← links)
- Optimal parallel algorithms for rectilinear link-distance problems (Q1897477) (← links)
- Maximum packing for biconnected outerplanar graphs (Q1962022) (← links)
- An optimal algorithm for broadcasting multiple messages in trees (Q1970213) (← links)
- Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642) (← links)
- Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth (Q1989349) (← links)
- Solving hard problems by protein folding? (Q2038347) (← links)
- On parallel time in population protocols (Q2094385) (← links)
- A simple approach to nondecreasing paths (Q2203587) (← links)
- Corrigendum to ``Note on covering monotone orthogonal polygons'' (Q2252650) (← links)
- Graphs with equal domination and covering numbers (Q2292127) (← links)
- Pushing the online matrix-vector conjecture off-line and identifying its easy cases (Q2327098) (← links)
- Approximation algorithms for the geometric firefighter and budget fence problems (Q2331446) (← links)
- A fast parallel algorithm for minimum-cost small integral flows (Q2354029) (← links)
- Faster algorithms for finding lowest common ancestors in directed acyclic graphs (Q2373733) (← links)
- Performing work in broadcast networks (Q2375307) (← links)
- Efficient broadcasting in radio networks with long-range interference (Q2375820) (← links)
- Note on covering monotone orthogonal polygons with star-shaped polygons (Q2380027) (← links)
- Efficiently correcting matrix products (Q2408920) (← links)
- Computing the rooted triplet distance between galled trees by counting triangles (Q2442817) (← links)
- A note on a QPTAS for maximum weight triangulation of planar point sets (Q2448113) (← links)
- Max-stretch reduction for tree spanners (Q2480904) (← links)
- A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation (Q2489546) (← links)
- Polynomial-time algorithms for the ordered maximum agreement subtree problem (Q2642315) (← links)
- Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases (Q2656173) (← links)
- Lower bounds for Boolean circuits of bounded negation width (Q2672949) (← links)
- Online and approximate network construction from bounded connectivity constraints (Q2692731) (← links)
- (Q2723944) (← links)
- (Q2754202) (← links)
- (Q2762518) (← links)
- Efficient Merging and Construction of Evolutionary Trees (Q2765955) (← links)
- The do-all problem in broadcast networks (Q2787672) (← links)
- TOWARDS MORE EFFICIENT INFECTION AND FIRE FIGHTING (Q2841981) (← links)
- Counting and Detecting Small Subgraphs via Equations (Q2848542) (← links)
- Unique subgraphs are not easier to find (Q2855752) (← links)
- Detecting and Counting Small Pattern Graphs (Q2872118) (← links)
- The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree (Q2884583) (← links)
- A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs (Q2891383) (← links)
- Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles (Q2904512) (← links)
- Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others? (Q2914309) (← links)
- (Q2934691) (← links)
- The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets (Q2942263) (← links)
- Efficiently Correcting Matrix Products (Q2942613) (← links)
- 3D Rectangulations and Geometric Matrix Multiplication (Q2942614) (← links)
- On parallel complexity of planar triangulations (Q2956699) (← links)
- Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors) (Q2971137) (← links)
- A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques (Q2980911) (← links)