Andrzej Lingas

According to our database1, Andrzej Lingas authored at least 202 papers between 1978 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth.
Theor. Comput. Sci., 2020

Graphs with equal domination and covering numbers.
J. Comb. Optim., 2020

Computing the Boolean Product of Two <i>n</i> × <i>n</i> Boolean Matrices Using <i>O</i>(<i>n</i><sup>2</sup>) Mechanical Operations.
Int. J. Unconv. Comput., 2020

Quantum and approximation algorithms for maximum witnesses of Boolean matrix products.
CoRR, 2020

Computing the Boolean product of two n\times n Boolean matrices using O(n^2) mechanical operation.
CoRR, 2020

2019
A fast deterministic detection of small pattern graphs in graphs without large cliques.
Theor. Comput. Sci., 2019

Clearing directed subgraphs by mobile agents: Variations on covering with paths.
J. Comput. Syst. Sci., 2019

On a Fire Fighter's Problem.
Int. J. Found. Comput. Sci., 2019

The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets.
Discret. Appl. Math., 2019

Lower Bounds for DeMorgan Circuits of Bounded Negation Width.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs.
Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases.
Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

2018
A QPTAS for the base of the number of crossing-free structures on a planar point set.
Theor. Comput. Sci., 2018

Approximation Schemes for Capacitated Geometric Network Design.
SIAM J. Discret. Math., 2018

Determining the Consistency of Resolved Triplets and Fan Triplets.
J. Comput. Biol., 2018

Are unique subgraphs not easier to find?
Inf. Process. Lett., 2018

Small Normalized Boolean Circuits for Semi-disjoint Bilinear Forms Require Logarithmic Conjunction-depth.
Electron. Colloquium Comput. Complex., 2018

Lower Bounds for Circuits of Bounded Negation Width.
Electron. Colloquium Comput. Complex., 2018

Forest-like abstract Voronoi diagrams in linear time.
Comput. Geom., 2018

Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems.
Algorithms, 2018

Extreme Witnesses and Their Applications.
Algorithmica, 2018

3D Rectangulations and Geometric Matrix Multiplication.
Algorithmica, 2018

Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017
Efficiently Correcting Matrix Products.
Algorithmica, 2017

Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model.
Proceedings of the Theory and Applications of Models of Computation, 2017

Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution.
Proceedings of the Theory and Applications of Models of Computation, 2017

Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors).
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents).
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

2016
Minimum <i>k</i>-Connected Geometric Networks.
Encyclopedia of Algorithms, 2016

2015
Induced subgraph isomorphism: Are some patterns substantially easier than others?
Theor. Comput. Sci., 2015

Detecting and Counting Small Pattern Graphs.
SIAM J. Discret. Math., 2015

Detecting monomials with k distinct variables.
Inf. Process. Lett., 2015

A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows.
Algorithmica, 2015

The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014
Computing the rooted triplet distance between galled trees by counting triangles.
J. Discrete Algorithms, 2014

Corrigendum to "Note on covering monotone orthogonal polygons" [Inf. Process. Lett. 104(6) (2007) 220-227].
Inf. Process. Lett., 2014

A note on a QPTAS for maximum weight triangulation of planar point sets.
Inf. Process. Lett., 2014

Iterative merging heuristics for correlation clustering.
Int. J. Metaheuristics, 2014

Vector convolution in O(n) steps and matrix multiplication in O(n^2) steps : -).
Electron. Colloquium Comput. Complex., 2014

A QPTAS for the Base of the Number of Triangulations of a Planar Point Set.
CoRR, 2014

Efficient Algorithms for Subgraph Listing.
Algorithms, 2014

Efficiently Correcting Matrix Products.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Clearing Connections by Few Agents.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013
Counting and Detecting Small Subgraphs via Equations.
SIAM J. Discret. Math., 2013

Optimal cuts and partitions in tree metrics in polynomial time.
Inf. Process. Lett., 2013

Towards More Efficient Infection and Fire Fighting.
Int. J. Found. Comput. Sci., 2013

Unique subgraphs are not easier to find.
Int. J. Comput. Math., 2013

Efficient broadcasting in radio networks with long-range interference.
Distributed Comput., 2013

Simple Iterative Heuristics for Correlation Clustering.
Proceedings of the Large-Scale Scientific Computing - 9th International Conference, 2013

2012
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree.
SIAM J. Comput., 2012

Linear-Time 3-Approximation Algorithm for the R-Star Covering Problem.
Int. J. Comput. Geom. Appl., 2012

Optimal Cuts and Bisections on the Real Line in Polynomial Time
CoRR, 2012

Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems.
Algorithmica, 2012

A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs.
Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

2011
Approximation Algorithms for Buy-at-Bulk Geometric Network Design.
Int. J. Found. Comput. Sci., 2011

On joint triangulations of two sets of points in the plane
CoRR, 2011

A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication.
Algorithmica, 2011

Near Approximation of Maximum Weight Matching through Efficient Weight Reduction.
Proceedings of the Theory and Applications of Models of Computation, 2011

Counting and detecting small subgraphs via equations and matrix multiplication.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Unique Small Subgraphs Are Not Easier to Find.
Proceedings of the Language and Automata Theory and Applications, 2011

2010
Ptas for k-Tour Cover Problem on the Plane for Moderately Large Values of k.
Int. J. Found. Comput. Sci., 2010

Approximability of Edge Matching Puzzles.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

2009
Finding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix Multiplication.
SIAM J. Comput., 2009

An exact algorithm for subgraph homeomorphism.
J. Discrete Algorithms, 2009

Efficient approximation algorithms for shortest cycles in undirected graphs.
Inf. Process. Lett., 2009

Faster multi-witnesses for Boolean matrix multiplication.
Inf. Process. Lett., 2009

Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications
CoRR, 2009

Efficient broadcasting in known topology radio networks with long-range interference.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

PTAS for <i>k</i>-Tour Cover Problem on the Plane for Moderately Large Values of <i>k</i>.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
Minimum k-Connected Geometric Networks.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Approximate clustering of incomplete fingerprints.
J. Discrete Algorithms, 2008

Max-Stretch Reduction for Tree Spanners.
Algorithmica, 2008

Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Linear-Time 3-Approximation Algorithm for the <i>r</i> -Star Covering Problem.
Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

A Path Cover Technique for LCAs in Dags.
Proceedings of the Algorithm Theory, 2008

2007
Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Faster algorithms for finding lowest common ancestors in directed acyclic graphs.
Theor. Comput. Sci., 2007

Approximating the maximum clique minor and some subgraph homeomorphism problems.
Theor. Comput. Sci., 2007

Note on covering monotone orthogonal polygons with star-shaped polygons.
Inf. Process. Lett., 2007

On the Approximability of Maximum and Minimum Edge Clique Partition Problems.
Int. J. Found. Comput. Sci., 2007

Embedding Point Sets into Plane Graphs of Small Dilation.
Int. J. Comput. Geom. Appl., 2007

Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem.
Algorithmica, 2007

On Exact Complexity of Subgraph Homeomorphism.
Proceedings of the Theory and Applications of Models of Computation, 2007

Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication.
Proceedings of the Algorithms, 2007

Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006
Preface.
Theor. Comput. Sci., 2006

Finding a Heaviest Triangle is not Harder than Matrix Multiplication.
Electron. Colloquium Comput. Complex., 2006

Performing work in broadcast networks.
Distributed Comput., 2006

A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation.
Comput. Geom., 2006

Minimum-Energy Broadcasting in Wireless Networks in the <i>d</i>-Dimensional Euclidean Space (The <i>alpha</i><=<i>d</i> Case).
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

2005
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs.
SIAM J. Comput., 2005

A note on maximum independent set and related problems on box graphs.
Inf. Process. Lett., 2005

Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth.
Inf. Process. Lett., 2005

LCA Queries in Directed Acyclic Graphs.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Approximate Clustering of Fingerprint Vectors with Missing Values.
Proceedings of the Theory of Computing 2005, 2005

2004
Approximation algorithms for Hamming clustering problems.
J. Discrete Algorithms, 2004

Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs.
Fundam. Informaticae, 2004

On approximation of the maximum clique minor containment problem and some subgraph homeomorphism problems
Electron. Colloquium Comput. Complex., 2004

A fast algorithm for approximating the detour of a polygonal chain.
Comput. Geom., 2004

Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices.
Proceedings of the Algorithm Theory, 2004

2003
Trade-Offs Between Load and Degree in Virtual Path Layouts.
Parallel Process. Lett., 2003

A Fast Algorithm for Optimal Alignment between Similar Ordered Trees.
Fundam. Informaticae, 2003

An Improved Bound on Boolean Matrix Multiplication for Highly Clustered Data.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002
On adaptive deterministic gossiping in ad hoc radio networks.
Inf. Process. Lett., 2002

Approximation algorithms for time-dependent orienteering.
Inf. Process. Lett., 2002

Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains.
Proceedings of the Algorithm Theory, 2002

A Geometric Approach to Boolean Matrix Multiplication.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Gossiping with Bounded Size Messages in ad hoc Radio Networks.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001
Approximation algorithms for maximum two-dimensional pattern matching.
Theor. Comput. Sci., 2001

Efficient Merging and Construction of Evolutionary Trees.
J. Algorithms, 2001

Fast Boolean Matrix Multiplication for Highly Clustered Data.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

The do-all problem in broadcast networks.
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

Oblivious gossiping in ad-hoc radio networks.
Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), 2001

2000
Maximum packing for k-connected partial k-trees in polynomial time.
Theor. Comput. Sci., 2000

A Polynomial Time Approximation Scheme for MAX-BISECTION on Planar Graphs
Electron. Colloquium Comput. Complex., 2000

Approximation Algorithms for MAX-BISECTION on Low Degree Reg ular Graphs and Planar Graphs
Electron. Colloquium Comput. Complex., 2000

Maximum packing for biconnected outerplanar graphs.
Discret. Appl. Math., 2000

Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees.
Algorithmica, 2000

Fast Approximation Schemes for Euclidean Multi-connectivity Problems.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999
An Optimal Algorithm for Broadcasting Multiple Messages in Trees.
J. Parallel Distributed Comput., 1999

On the Complexity of Constructing Evolutionary Trees.
J. Comb. Optim., 1999

Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions.
Proceedings of the STACS 99, 1999

Efficient Approximation Algorithms for the Hamming Center Problem.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

On Approximability of the Minimum-Cost <i>k</i>-Connected Spanning Subgraph Problem.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Efficient Merging, Construction, and Maintenance of Evolutionary Trees.
Proceedings of the Automata, 1999

1998
Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions.
Theory Comput. Syst., 1998

Improved Bounds for Integer Sorting in the EREW PRAM Model.
J. Parallel Distributed Comput., 1998

A Note on Parallel Complexity of Maximum <i>f</i>-Matching.
Inf. Process. Lett., 1998

Optimal Broadcasting in Almost Trees and Partial k-trees.
Proceedings of the STACS 98, 1998

Ultrafast Randomized Parallel Construction and Approximation Algorithms for Spanning Forests in Dense Graphs.
Proceedings of the Parallel and Distributed Processing, 10 IPPS/SPDP'98 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Orlando, Florida, USA, March 30, 1998

A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Subexponential-time algorithms for minimum weight triangulations and related problems.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Inferring Ordered Trees from Local Constraints.
Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

1997
Maximum Tree-Packing in Time O(n<sup>5/2</sup>).
Theor. Comput. Sci., 1997

A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon.
Theor. Comput. Sci., 1997

A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree.
Parallel Process. Lett., 1997

On the Complexity of Computing Evolutionary Trees.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996
Guest Editor's Foreword.
Nord. J. Comput., 1996

A Simple NC-Algorithm for a Maximal Independent set in a Hypergraph of Poly-Log Arboricity.
Inf. Process. Lett., 1996

A Simple Randomized Parallel Algorithm for Maximal f-Matchings.
Inf. Process. Lett., 1996

On 2-QBF Truth Testing in Parallel.
Inf. Process. Lett., 1996

A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon.
Int. J. Comput. Geom. Appl., 1996

On the Power of Nonconservative PRAM.
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

1995
Multilist Layering: Complexity and Applications.
Theor. Comput. Sci., 1995

Manhattonian proximity in a simple polygon.
Int. J. Comput. Geom. Appl., 1995

On computing Voronoi diagrams for sorted point sets.
Int. J. Comput. Geom. Appl., 1995

Optimal Parallel Algorithms for Rectilinear Link-Distance Problems.
Algorithmica, 1995

A Linear-time Construction of the Relative Neighborhood Graph within a Histogram.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

On Parallel Complexity of Planar Triangulations.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

Fast Skeleton Construction.
Proceedings of the Algorithms, 1995

1994
Editor's Foreword.
Nord. J. Comput., 1994

A Linear-time Construction of the Relative Neighborhood Graph From the Delaunay Triangulation.
Comput. Geom., 1994

On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Hamiltonian Abstract Voronoi Diagrams in Linear Time.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993
Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings.
Int. J. Found. Comput. Sci., 1993

Multi-List Ranking: Complexity and Applications.
Proceedings of the STACS 93, 1993

The Maximum k-Dependent and f-Dependent Set Problem.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Parallel Algorithms for Rectilinear Link Distance Problems.
Proceedings of the Seventh International Parallel Processing Symposium, 1993

A Note on Generalizations of Chew's Algorithm for the Voronoi Diagram of a Convex Polygon.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992
An O(n log n) Algorithm for Computing the Link Center of a Simple Polygon.
Discret. Comput. Geom., 1992

Fast Algorithms for Greedy Triangulation.
BIT Comput. Sci. Sect., 1992

There Are Planar Graphs Almost as Good as the Complete Graphs and Almost as Cheap as Minimum Spanning Trees.
Algorithmica, 1992

A Simple Randomized Parallel Algorithm for Maximal <i>f</i>-Matching.
Proceedings of the LATIN '92, 1992

On the Relationship among Constrained Geometric Structures.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992

C-sensitive Triangulations Approximate the MinMax Length Triangulation.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1992

1991
Bit Complexity of Matrix Products.
Inf. Process. Lett., 1991

An Unfeasible Matching Problem.
BIT Comput. Sci. Sect., 1991

On Computing the Voronoi Diagram for Restricted Planar Figures.
Proceedings of the Algorithms and Data Structures, 1991

Dynamic Detection of Forest of Tree-Connected Meshes.
Proceedings of the International Conference on Parallel Processing, 1991

Greedy Triangulation Approximates the Optimum and Can Be Implemented in Linear Time in the Average Case.
Proceedings of the Advances in Computing and Information, 1991

1990
A Note on a Parallel Heuristic for Minimum.
Bull. EATCS, 1990

Efficient Parallel Algorithms for Path Problems in Planar Directed Graphs.
Proceedings of the Algorithms, 1990

Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1990

1989
On Parallel Complexity of the Subgraph Homeomorphism and the Subgraph Isomorphism Problem for Classes of Planar Graphs.
Theor. Comput. Sci., 1989

Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time.
Theor. Comput. Sci., 1989

Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems.
Theor. Comput. Sci., 1989

Subtree Isomorphism is NC Reducible to Bipartite Perfect Matching.
Inf. Process. Lett., 1989

Voronoi Diagrams with Barriers and the Shortest Diagonal Problem.
Inf. Process. Lett., 1989

Ther Are Planar Graphs Almost as Good as the Complete Graphs and as Short as Minimum Spanning Trees.
Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

1988
Recognizing polygons, or how to spy.
Vis. Comput., 1988

Greedy Triangulation acn be Efficiently Implemented in the Average Case (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1988

An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams.
Proceedings of the SWAT 88, 1988

A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987
Algorithms for Minimum Length Partitions of Polygons.
BIT Comput. Sci. Sect., 1987

On Approximation Behavior of the Greedy Triangulation for Convex Polygons.
Algorithmica, 1987

Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

Fast Parallel Algorithms for the Subgraph Homophormism and the Subgraph Isomorphism Problem for Classes of Planat Graphs.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

1986
On Approximation Behavior and Implementation of the Greedy Triangulation for Convex Planar Point Sets.
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985
On partitioning polygons.
Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984
Covering Polygons with Minimum Number of Rectangles.
Proceedings of the STACS 84, 1984

Bounds on the Length of Convex Partitions of Polygons.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1984

1983
Heuristics for minimum edge length rectangular partitions of rectilinear figures.
Proceedings of the Theoretical Computer Science, 1983

A Note on Computational Complexity of Logic Programs.
Proceedings of the Logic Programming Workshop '83, Praia da Falésia, Algarve, Portugal, 26 June, 1983

The Greedy and Delauney Triangulations are not Bad in the Average Case and Minimum Weight Geometric Triangulation of Multi-Connected Polygons is NP-Complete.
Proceedings of the Fundamentals of Computation Theory, 1983

An Application of Maximum Bipartite C-Matching to Subtree Isomorphism.
Proceedings of the CAAP'83, 1983

1982
The Power of Non-Rectilinear Holes.
Proceedings of the Automata, 1982

1981
Certain Algorithms for Subgraph Isomorphism Problems.
Proceedings of the CAAP '81, 1981

1979
The complexity of distributive computations.
Proceedings of the Fundamentals of Computation Theory, 1979

1978
A PSPACE Complete Problem Related to a Pebble Game.
Proceedings of the Automata, 1978


  Loading...