| Publication | Date of Publication | Type |
|---|
Theoretical approximation ratios for warm-started QAOA on 3-regular max-cut instances at depth \(p = 1\)
Theoretical Computer Science | 2025-12-05 | Paper |
Generating hidden Markov models from process models through nonnegative tensor factorization
ACM Transactions on Modeling and Computer Simulation | 2024-11-15 | Paper |
| Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers | 2023-01-01 | Paper |
| Quantum Volume in Practice: What Users Can Expect from NISQ Devices Dataset | 2022-03-22 | Dataset |
Deterministic preparation of Dicke states
(available as arXiv preprint) | 2020-01-30 | Paper |
Online dominating set
Algorithmica | 2019-05-07 | Paper |
Incentive compatible and globally efficient position based routing for selfish reverse multicast in wireless sensor networks
Algorithms | 2018-08-20 | Paper |
Online Dominating Set
(available as arXiv preprint) | 2017-10-17 | Paper |
Optimal placement of ad hoc devices under a VCG-style routing protocol
Monographs in Theoretical Computer Science. An EATCS Series | 2011-04-05 | Paper |
Double digest revisited: complexity and approximability in the presence of noisy data
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Criticality analysis of internet infrastructure
Computer Networks | 2010-05-11 | Paper |
Composing equipotent teams.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
| On the complexity of variations of equal sum subsets | 2009-10-12 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
ON A NEW CLASS OF LOAD BALANCING NETWORK PROTOCOLS
Advances in Complex Systems | 2008-05-28 | Paper |
Finding minimum hidden guard sets in polygons --- tight approximability results
Computational Geometry | 2006-05-16 | Paper |
Partial digest is hard to solve for erroneous input data
Theoretical Computer Science | 2006-03-20 | Paper |
| scientific article; zbMATH DE number 2089209 (Why is no real title available?) | 2004-08-12 | Paper |
An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee
SIAM Journal on Computing | 2003-06-19 | Paper |
| scientific article; zbMATH DE number 1877049 (Why is no real title available?) | 2003-03-20 | Paper |
| scientific article; zbMATH DE number 1759472 (Why is no real title available?) | 2002-11-25 | Paper |
Approximation algorithms for terrain guarding.
Information Processing Letters | 2002-07-14 | Paper |
Inapproximability of finding maximum hidden sets on polygons and terrains
Computational Geometry | 2002-03-14 | Paper |
Inapproximability results for guarding polygons and terrains
Algorithmica | 2001-10-14 | Paper |
| scientific article; zbMATH DE number 1522929 (Why is no real title available?) | 2000-10-30 | Paper |
