| Publication | Date of Publication | Type |
|---|
Quantum and approximation algorithms for maximum witnesses of Boolean matrix products
International Journal of Foundations of Computer Science | 2024-10-30 | Paper |
Rare siblings speed-up deterministic detection and counting of small pattern graphs
Algorithmica | 2023-04-11 | Paper |
The two-line center problem from a polar view: a new algorithm and data structure
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Retrieval of scattered information by EREW, CREW and CRCW PRAMs
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
Quantum and approximation algorithms for maximum witnesses of Boolean matrix products
(available as arXiv preprint) | 2022-03-24 | Paper |
A simple approach to nondecreasing paths
Information Processing Letters | 2020-10-07 | Paper |
Rare siblings speed-up deterministic detection and counting of small pattern graphs
Fundamentals of Computation Theory | 2020-01-30 | Paper |
A fast deterministic detection of small pattern graphs in graphs without large cliques
Theoretical Computer Science | 2019-05-02 | Paper |
Are unique subgraphs not easier to find?
Information Processing Letters | 2018-04-04 | Paper |
| Counting and detecting small subgraphs via equations and matrix multiplication | 2017-09-29 | Paper |
A fast deterministic detection of small pattern graphs in graphs without large cliques
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Induced subgraph isomorphism: are some patterns substantially easier than others?
Theoretical Computer Science | 2015-10-30 | Paper |
\(\beta\)-skeletons for a set of line segments in \(\mathbb R^2\)
Fundamentals of Computation Theory | 2015-09-29 | Paper |
Detecting and counting small pattern graphs
SIAM Journal on Discrete Mathematics | 2015-08-17 | Paper |
New sequential and parallel algorithms for computing the \(\beta\)-spectrum
Theoretical Computer Science | 2015-06-10 | Paper |
Detecting and Counting Small Pattern Graphs
Algorithms and Computation | 2014-01-14 | Paper |
Unique subgraphs are not easier to find
International Journal of Computer Mathematics | 2013-10-22 | Paper |
Counting and detecting small subgraphs via equations
SIAM Journal on Discrete Mathematics | 2013-09-26 | Paper |
New sequential and parallel algorithms for computing the \(\beta \)-spectrum
Fundamentals of Computation Theory | 2013-08-16 | Paper |
Induced subgraph isomorphism: are some patterns substantially easier than others?
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Unique small subgraphs are not easier to find
Language and Automata Theory and Applications | 2011-06-03 | Paper |
Faster multi-witnesses for Boolean matrix multiplication
Information Processing Letters | 2010-06-16 | Paper |
Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication
Algorithms – ESA 2007 | 2008-09-25 | Paper |
A Path Cover Technique for LCAs in Dags
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
Theoretical Computer Science | 2007-07-16 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
| scientific article; zbMATH DE number 2140434 (Why is no real title available?) | 2005-03-03 | Paper |
Sets of lines and cutting out polyhedral objects
Computational Geometry | 2003-05-19 | Paper |
Algorithms for the parallel alternating direction access machine
Theoretical Computer Science | 2000-08-21 | Paper |
A geometric proof of the combinatorial bounds for the number of optimal solutions for the Euclidean 2-center problem
Computational Geometry | 2000-04-25 | Paper |
Retrieval of scattered information by EREW, CREW, and CRCW PRAMs
Computational Complexity | 1996-05-27 | Paper |
\(O(\log \log n)\)-time integer geometry on the CRCW PRAM
Algorithmica | 1995-07-24 | Paper |
Constructing the relative neighborhood graph in 3-dimensional Euclidean space
Discrete Applied Mathematics | 1992-06-25 | Paper |
| scientific article; zbMATH DE number 4213461 (Why is no real title available?) | 1990-01-01 | Paper |
