| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6128571 | 2024-04-15 | Paper |
| Greedy triangulation can be efficiently implemented in the average case | 2024-02-28 | Paper |
| Finding small complete subgraphs efficiently | 2023-12-22 | Paper |
| Maximum tree-packing in time O(n5/2) | 2023-12-12 | Paper |
| Perpetual maintenance of machines with different urgency requirements | 2023-10-24 | Paper |
| Online and Approximate Network Construction from Bounded Connectivity Constraints | 2023-08-18 | Paper |
| Lower bounds for monotone \(q\)-multilinear Boolean circuits | 2023-08-14 | Paper |
| An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs | 2023-05-08 | Paper |
| Fast skeleton construction | 2023-05-08 | Paper |
| Rare siblings speed-up deterministic detection and counting of small pattern graphs | 2023-04-11 | Paper |
| Online and approximate network construction from bounded connectivity constraints | 2023-03-22 | Paper |
| Minimum convex partition of a polygon with holes by cuts in given directions | 2023-01-25 | Paper |
| A linear-time construction of the relative neighborhood graph within a histogram | 2022-12-16 | Paper |
| Fast algorithms for greedy triangulation | 2022-12-09 | Paper |
| A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon | 2022-12-09 | Paper |
| On parallel time in population protocols | 2022-10-28 | Paper |
| On parallel complexity of maximum f-matching and the degree sequence problem | 2022-08-18 | Paper |
| An O(n log n) algorithm for computing a link center in a simple polygon | 2022-08-16 | Paper |
| Lower Bounds for DeMorgan Circuits of Bounded Negation Width | 2022-07-18 | Paper |
| Lower bounds for Boolean circuits of bounded negation width | 2022-06-13 | Paper |
| Quantum and approximation algorithms for maximum witnesses of Boolean matrix products | 2022-03-24 | Paper |
| Solving hard problems by protein folding? | 2021-07-06 | Paper |
| Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases | 2021-03-10 | Paper |
| A simple approach to nondecreasing paths | 2020-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5121914 | 2020-09-22 | Paper |
| Simple Iterative Heuristics for Correlation Clustering | 2020-08-25 | Paper |
| Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth | 2020-04-21 | Paper |
| Graphs with equal domination and covering numbers | 2020-02-03 | Paper |
| Rare siblings speed-up deterministic detection and counting of small pattern graphs | 2020-01-30 | Paper |
| Approximation algorithms for the geometric firefighter and budget fence problems | 2019-10-29 | Paper |
| Pushing the online matrix-vector conjecture off-line and identifying its easy cases | 2019-10-11 | Paper |
| On a Fire Fighter’s Problem | 2019-06-24 | Paper |
| Clearing directed subgraphs by mobile agents. Variations on covering with paths | 2019-05-03 | Paper |
| A fast deterministic detection of small pattern graphs in graphs without large cliques | 2019-05-02 | Paper |
| Efficient algorithms for subgraph listing | 2019-03-26 | Paper |
| The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets | 2019-03-11 | Paper |
| Approximation Schemes for Capacitated Geometric Network Design | 2018-11-28 | Paper |
| Extreme witnesses and their applications | 2018-10-18 | Paper |
| Are unique subgraphs not easier to find? | 2018-04-04 | Paper |
| Determining the consistency of resolved triplets and fan triplets | 2018-03-22 | Paper |
| 3D rectangulations and geometric matrix multiplication | 2018-02-28 | Paper |
| Forest-like abstract Voronoi diagrams in linear time | 2018-02-19 | Paper |
| A QPTAS for the base of the number of crossing-free structures on a planar point set | 2018-02-16 | Paper |
| Faster algorithms for subgraph isomorphism of κ-connected partial κ-trees | 2017-12-05 | Paper |
| The snow team problem (clearing directed subgraphs by mobile agents) | 2017-11-22 | Paper |
| Efficiently correcting matrix products | 2017-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365132 | 2017-09-29 | Paper |
| Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution | 2017-05-19 | Paper |
| Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model | 2017-05-19 | Paper |
| A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques | 2017-05-05 | Paper |
| Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors) | 2017-04-04 | Paper |
| On parallel complexity of planar triangulations | 2017-01-19 | Paper |
| A note on parallel complexity of maximum \(f\)-matching | 2016-06-09 | Paper |
| The do-all problem in broadcast networks | 2016-03-04 | Paper |
| Extreme Witnesses and Their Applications | 2016-02-05 | Paper |
| Induced subgraph isomorphism: are some patterns substantially easier than others? | 2015-10-30 | Paper |
| A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set | 2015-10-27 | Paper |
| Efficiently Correcting Matrix Products | 2015-09-11 | Paper |
| 3D Rectangulations and Geometric Matrix Multiplication | 2015-09-11 | Paper |
| The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets | 2015-08-20 | Paper |
| Detecting and Counting Small Pattern Graphs | 2015-08-17 | Paper |
| A fast parallel algorithm for minimum-cost small integral flows | 2015-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934691 | 2014-12-18 | Paper |
| Detecting monomials with \(k\) distinct variables | 2014-12-09 | Paper |
| Optimal cuts and partitions in tree metrics in polynomial time | 2014-08-13 | Paper |
| Efficient broadcasting in known topology radio networks with long-range interference | 2014-07-23 | Paper |
| Corrigendum to ``Note on covering monotone orthogonal polygons | 2014-07-18 | Paper |
| A note on a QPTAS for maximum weight triangulation of planar point sets | 2014-04-30 | Paper |
| Computing the rooted triplet distance between galled trees by counting triangles | 2014-04-01 | Paper |
| Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems | 2014-03-31 | Paper |
| Detecting and Counting Small Pattern Graphs | 2014-01-14 | Paper |
| Unique subgraphs are not easier to find | 2013-10-22 | Paper |
| Counting and Detecting Small Subgraphs via Equations | 2013-09-26 | Paper |
| TOWARDS MORE EFFICIENT INFECTION AND FIRE FIGHTING | 2013-07-30 | Paper |
| Efficient broadcasting in radio networks with long-range interference | 2013-06-25 | Paper |
| Performing work in broadcast networks | 2013-06-13 | Paper |
| LINEAR-TIME 3-APPROXIMATION ALGORITHM FOR THE r-STAR COVERING PROBLEM | 2012-11-23 | Paper |
| Exact and approximation algorithms for geometric and capacitated set cover problems | 2012-11-21 | Paper |
| Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others? | 2012-09-25 | Paper |
| Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles | 2012-08-14 | Paper |
| A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs | 2012-06-15 | Paper |
| The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree | 2012-05-30 | Paper |
| APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN | 2012-03-13 | Paper |
| A fast output-sensitive algorithm for Boolean matrix multiplication | 2011-08-16 | Paper |
| Approximation Schemes for Capacitated Geometric Network Design | 2011-07-06 | Paper |
| Near Approximation of Maximum Weight Matching through Efficient Weight Reduction | 2011-07-01 | Paper |
| Unique Small Subgraphs Are Not Easier to Find | 2011-06-03 | Paper |
| Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs | 2011-03-18 | Paper |
| PTAS FOR k-TOUR COVER PROBLEM ON THE PLANE FOR MODERATELY LARGE VALUES OF k | 2011-01-19 | Paper |
| Efficient approximation algorithms for shortest cycles in undirected graphs | 2010-08-16 | Paper |
| Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems | 2010-07-20 | Paper |
| Faster multi-witnesses for Boolean matrix multiplication | 2010-06-16 | Paper |
| Finding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix Multiplication | 2010-04-29 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Note on covering monotone orthogonal polygons with star-shaped polygons | 2010-03-24 | Paper |
| Approximability of Edge Matching Puzzles | 2010-01-28 | Paper |
| PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k | 2009-12-17 | Paper |
| An exact algorithm for subgraph homeomorphism | 2009-12-10 | Paper |
| Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth | 2009-12-04 | Paper |
| A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication | 2009-10-29 | Paper |
| Approximation Algorithms for Buy-at-Bulk Geometric Network Design | 2009-10-20 | Paper |
| A note on maximum independent set and related problems on box graphs | 2009-08-27 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Approximating the maximum clique minor and some subgraph homeomorphism problems | 2009-06-22 | Paper |
| Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges | 2008-11-20 | Paper |
| Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication | 2008-09-25 | Paper |
| A Path Cover Technique for LCAs in Dags | 2008-07-15 | Paper |
| Minimum-Energy Broadcasting in Wireless Networks in the d-Dimensional Euclidean Space (The α≤d Case) | 2008-04-17 | Paper |
| Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs | 2008-04-15 | Paper |
| Max-stretch reduction for tree spanners | 2008-04-03 | Paper |
| Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem | 2008-03-25 | Paper |
| Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs | 2008-01-04 | Paper |
| On Exact Complexity of Subgraph Homeomorphism | 2007-11-13 | Paper |
| Polynomial-time algorithms for the ordered maximum agreement subtree problem | 2007-08-20 | Paper |
| Faster algorithms for finding lowest common ancestors in directed acyclic graphs | 2007-07-16 | Paper |
| EMBEDDING POINT SETS INTO PLANE GRAPHS OF SMALL DILATION | 2007-07-13 | Paper |
| Approximation algorithms for Hamming clustering problems | 2007-04-26 | Paper |
| ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS | 2007-04-25 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation | 2006-04-28 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs | 2005-10-28 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4654270 | 2005-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829002 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046480 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737173 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737224 | 2004-08-11 | Paper |
| A fast algorithm for approximating the detour of a polygonal chain. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4432975 | 2003-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427871 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796185 | 2003-03-02 | Paper |
| Approximation algorithms for time-dependent orienteering. | 2003-01-21 | Paper |
| On adaptive deterministic gossiping in ad hoc radio networks. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782745 | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778560 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547753 | 2002-08-21 | Paper |
| Efficient Merging and Construction of Evolutionary Trees | 2002-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762518 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252299 | 2001-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754202 | 2001-12-09 | Paper |
| Approximation algorithms for maximum two-dimensional pattern matching | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723944 | 2001-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525679 | 2001-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953346 | 2001-01-14 | Paper |
| Maximum packing for biconnected outerplanar graphs | 2000-09-15 | Paper |
| Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees | 2000-08-27 | Paper |
| Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time | 2000-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942233 | 2000-03-21 | Paper |
| An optimal algorithm for broadcasting multiple messages in trees | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942643 | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251050 | 2000-01-19 | Paper |
| On the complexity of constructing evolutionary trees | 1999-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268437 | 1999-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252402 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246739 | 1999-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219046 | 1999-06-08 | Paper |
| Minimum convex partition of a polygon with holes by cuts in given directions | 1998-11-11 | Paper |
| A nearly parallel algorithm for the Voronoi diagram of a convex polygon | 1998-10-22 | Paper |
| Improved bounds for integer sorting in the EREW PRAM model | 1998-07-29 | Paper |
| Maximum tree-packing in time \(O(n^{5/2})\) | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364583 | 1997-12-15 | Paper |
| A simple randomized parallel algorithm for maximal f-matchings | 1997-02-28 | Paper |
| On 2-QBF truth testing in parallel | 1997-02-28 | Paper |
| Multilist layering: Complexity and applications | 1997-02-28 | Paper |
| A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity | 1997-02-27 | Paper |
| A LINEAR-TIME RANDOMIZED ALGORITHM FOR THE BOUNDED VORONOI DIAGRAM OF A SIMPLE POLYGON | 1996-12-16 | Paper |
| ON COMPUTING VORONOI DIAGRAMS FOR SORTED POINT SETS | 1996-04-16 | Paper |
| Optimal parallel algorithms for rectilinear link-distance problems | 1995-08-27 | Paper |
| MANHATTONIAN PROXIMITY IN A SIMPLE POLYGON | 1995-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4764624 | 1995-06-08 | Paper |
| A linear-time construction of the relative neighborhood graph from the Delaunay triangulation | 1994-09-25 | Paper |
| PARALLEL ALGORITHMS FOR FINDING MAXIMAL k-DEPENDENT SETS AND MAXIMAL f-MATCHINGS | 1994-03-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281530 | 1994-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037407 | 1993-05-18 | Paper |
| Fast algorithms for greedy triangulation | 1992-12-14 | Paper |
| An \(O(n\log n)\) algorithm for computing the link center of a simple polygon | 1992-09-27 | Paper |
| There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees | 1992-09-27 | Paper |
| An unfeasible matching problem | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3971267 | 1992-06-25 | Paper |
| Bit complexity of matrix products | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359785 | 1990-01-01 | Paper |
| Subtree isomorphism is NC reducible to bipartite perfect matching | 1989-01-01 | Paper |
| Voronoi diagrams with barriers and the shortest diagonal problem | 1989-01-01 | Paper |
| On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs | 1989-01-01 | Paper |
| Heuristics for optimum binary search trees and minimum weight triangulation problems | 1989-01-01 | Paper |
| Subgraph isomorphism for biconnected outerplanar graphs in cubic time | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3484376 | 1989-01-01 | Paper |
| Recognizing polygons, or how to spy | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796755 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798256 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3804190 | 1988-01-01 | Paper |
| On approximation behavior of the greedy triangulation for convex polygons | 1987-01-01 | Paper |
| Algorithms for minimum length partitions of polygons | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783595 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785967 | 1987-01-01 | Paper |
| A New Heuristic for Minimum Weight Triangulation | 1987-01-01 | Paper |
| The greedy and Delaunay triangulations are not bad in the average case | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3731030 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3217601 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3339306 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3310634 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3311658 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3948588 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3962480 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3912032 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3859257 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4192112 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4194458 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4139689 | 1977-01-01 | Paper |
