1 – 109 of 109
- show: 250
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2023
-
Mark
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs
(
- Contribution to journal › Article
-
Mark
On parallel time in population protocols
(
- Contribution to journal › Article
-
Mark
Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique.
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2022
-
Mark
A Multi-Dimensional Matrix Product—A Natural Tool for Parameterized Graph Algorithms
(
- Contribution to journal › Article
-
Mark
An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs
2022) 8th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2022 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 13179 LNCS. p.140-151(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Efficient Assignment of Identities in Anonymous Populations
2022) 25th International Conference on Principles of Distributed Systems (OPODIS 2021) In Leibniz International Proceedings in Informatics (LIPIcs) 217. p.1-21(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2021
-
Mark
Online and Approximate Network Construction from Bounded Connectivity Constraints
2021) 12th International Conference on Algorithms and Complexity (CIAC 2021) In Lecture Notes in Computer science 12701. p.314-325(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Consequences of APSP, triangle detection, and 3SUM hardness for separation between determinism and non-determinism
2021) 11th Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2021 In Procedia Computer Science 195. p.163-171(
- Contribution to journal › Article
-
Mark
Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases
(
- Contribution to journal › Article
-
Mark
Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products
2021) 7th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 12601 LNCS. p.440-451(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2020
-
Mark
A simple approach to nondecreasing paths
(
- Contribution to journal › Article
-
Mark
Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth
(
- Contribution to journal › Article
- 2019
-
Mark
Clearing directed subgraphs by mobile agents : Variations on covering with paths
(
- Contribution to journal › Article
-
Mark
On a Fire Fighter’s Problem
(
- Contribution to journal › Article
-
Mark
A fast deterministic detection of small pattern graphs in graphs without large cliques
(
- Contribution to journal › Article
-
Mark
Lower bounds for Demorgan circuits of bounded negation width
2019) 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019 In Leibniz International Proceedings in Informatics, LIPIcs 126.(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs
2019) 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 11651. p.322-334(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2018
-
Mark
3D Rectangulations and Geometric Matrix Multiplication
(
- Contribution to journal › Article
-
Mark
Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems
(
- Contribution to journal › Article
-
Mark
Extreme Witnesses and Their Applications
(
- Contribution to journal › Article
-
Mark
A QPTAS for the base of the number of crossing-free structures on a planar point set
(
- Contribution to journal › Article
- 2017
-
Mark
A fast deterministic detection of small pattern graphs in graphs without large cliques
2017) 11th International Conference and Workshops on Algorithms and Computation, WALCOM 2017 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10167 LNCS. p.217-227(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Efficiently Correcting Matrix Products
(
- Contribution to journal › Article
-
Mark
The snow team problem : (Clearing Directed subgraphs by mobile agents)
2017) 21th International Symposium on Fundamentals of Computation Theory, FCT 2017 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10472 LNCS. p.190-203(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2015
-
Mark
Detecting monomials with k distinct variables
(
- Contribution to journal › Article
-
Mark
A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows
(
- Contribution to journal › Article
- 2014
-
Mark
A note on a QPTAS for maximum weight triangulation of planar point sets
(
- Contribution to journal › Article
-
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
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
-
Mark
Simple Iterative Heuristics for Correlation Clustering
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2013
-
Mark
Optimal cuts and partitions in tree metrics in polynomial time
(
- Contribution to journal › Article
-
Mark
Counting and Detecting Small Subgraphs via Equations
(
- Contribution to journal › Article
-
Mark
Unique subgraphs are not easier to find
(
- Contribution to journal › Article
-
Mark
Towards more efficient infection and fire fighting
(
- 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
- 2012
-
Mark
The complexity of inferring a minimally resolved phylogenetic supertree
(
- 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
Linear-time 3-approximation algorithm for the r-star covering problem
(
- Contribution to journal › Article
-
Mark
An Approximation Algorithm for Directed Shallow Steiner Trees
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 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
A fast output-sensitive algorithm for Boolean matrix multiplication
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
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
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
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Approximate clustering of incomplete fingerprints
(
- 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
Max-stretch reduction for tree spanners
(
- Contribution to journal › Article
-
Mark
Linear-time 3-approximation algorithm for the r-star covering problem
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
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
- 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
Polynomial-time algorithms for the ordered maximum agreement subtree problem
(
- 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
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
(
- Contribution to journal › Article
-
Mark
Note on covering monotone orthogonal polygons with star-shaped polygons
(
- Contribution to journal › Article
-
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
On the approximability of maximum and minimum edge clique partition problems
(
- Contribution to journal › Article
- 2006
-
Mark
Performing work in broadcast networks
(
- 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
A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation
(
- Contribution to journal › Article
-
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
- 2005
-
Mark
Embedding point sets into plane graphs of small dilation
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
LCA queries in directed acyclic graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Max-stretch reduction for tree spanners
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Polynomial time approximation schemes for max-bisection on planar and geometric graphs
(
- Contribution to journal › Article
-
Mark
Approximate clustering of fingerprint vectors with missing values
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
A note on maximum independent set and related problems on box graphs
(
- Contribution to journal › Article
-
Mark
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
(
- Contribution to journal › Article
- 2004
-
Mark
Polynomial-time algorithms for the ordered maximum agreement subtree problem
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Subexponential-time framework for optimal embeddings of graphs in integer lattices
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Approximation algorithms for Hamming clustering problems
(
- Contribution to journal › Article
-
Mark
A fast algorithm for approximating the detour of a polygonal chain
(
- Contribution to journal › Article
-
Mark
Approximation algorithms for MAX-BISECTION on low degree regular graphs
(
- Contribution to journal › Article
- 2003
-
Mark
Fundamentals of computation theory
- Book/Report › Conference proceeding (editor)
-
Mark
An improved bound on Boolean matrix multiplication for highly clustered data
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Improved approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Subexponential-time algorithms for maximum independent set and related problems on box graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Trade-offs between load and degree in virtual path layouts
(
- Contribution to journal › Article
-
Mark
A fast algorithm for optimal alignment between similar ordered trees
(
- Contribution to journal › Article
- 2002
-
Mark
Polynomial-time approximation schemes for the Euclidean survivable network design problem
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Gossiping with bounded size messages in ad hoc radio networks (Extended abstract)
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
A geometric approach to Boolean matrix multiplication
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Adaptive algorithms for constructing convex hulls and triangulations of polygonal chains
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
On adaptive deterministic gossiping in ad hoc radio networks
(
- Contribution to journal › Article
-
Mark
On adaptive deterministic gossiping in ad hoc radio networks
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Approximation algorithms for time-dependent orienteering
(
- Contribution to journal › Article
- 2001
-
Mark
A fast algorithm for optimal alignment between similar ordered trees
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Fast Boolean matrix multiplication for highly clustered data
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2000
-
Mark
Fast approximation schemes for Euclidean multi-connectivity problems
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 1981
-
Mark
Certain algorithms for subgraph isomorphism problems
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 1979
-
Mark
The complexity of distributive computations
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 1978
-
Mark
A PSPACE complete problem related to a pebble game
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding