| Publication | Date of Publication | Type |
|---|
On central placements of new vertices in a planar point set
Theoretical Computer Science | 2024-12-12 | Paper |
A linear-time optimal broadcasting algorithm in stars of cliques
Journal of Graph Algorithms and Applications | 2024-11-12 | Paper |
| Distance-based solution of patrolling problems with individual waiting times | 2024-08-13 | Paper |
Searching for faulty leaves in binary trees
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search
Lecture Notes in Computer Science | 2023-05-08 | Paper |
| Searching for a monotone function by independent threshold queries | 2023-03-21 | Paper |
Two Robots Patrolling on a Line: Integer Version and Approximability
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges
Lecture Notes in Computer Science | 2022-10-13 | Paper |
| On an ordering problem in weighted hypergraphs | 2022-03-22 | Paper |
An optimization problem related to Bloom filters with bit patterns
SOFSEM 2018: Theory and Practice of Computer Science | 2020-10-21 | Paper |
Enumerating grid layouts of graphs
Journal of Graph Algorithms and Applications | 2020-09-04 | Paper |
| Dividing splittable goods evenly and with limited fragmentation | 2020-05-26 | Paper |
| Equitable induced decompositions of twin graphs | 2020-05-07 | Paper |
Branch-and-bound for the precedence constrained generalized traveling salesman problem
Operations Research Letters | 2020-04-07 | Paper |
Dividing splittable goods evenly and with limited fragmentation
Algorithmica | 2020-04-01 | Paper |
Optimal partial clique edge covering guided by potential energy minimization
Optimization Letters | 2019-10-18 | Paper |
Parameterized mixed graph coloring
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
Combinatorial search in two and more rounds
Theoretical Computer Science | 2019-06-06 | Paper |
| Saving probe bits by cube domination | 2018-11-22 | Paper |
The solution space of sorting with recurring comparison faults
Theory of Computing Systems | 2018-08-03 | Paper |
Line segmentation of digital curves in parallel
STACS 95 | 2017-12-04 | Paper |
Calculating approximation guarantees for partial set cover of pairs
Optimization Letters | 2017-11-09 | Paper |
Finding defectives on a line by random docking and interval group tests
Discrete Mathematics, Algorithms and Applications | 2017-10-20 | Paper |
Refined algorithms for hitting many intervals
Information Processing Letters | 2016-11-23 | Paper |
Deterministic versus randomized adaptive test cover
Theoretical Computer Science | 2016-10-21 | Paper |
Computing giant graph diameters
Lecture Notes in Computer Science | 2016-09-29 | Paper |
The solution space of sorting with recurring comparison faults
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Randomized group testing for mutually obscuring defectives
Information Processing Letters | 2016-06-09 | Paper |
Adaptive group testing with a constrained number of positive responses improved
Discrete Applied Mathematics | 2016-04-07 | Paper |
Sufficient conditions for edit-optimal clusters
Information Processing Letters | 2016-01-05 | Paper |
Pairs Covered by a Sequence of Sets
Fundamentals of Computation Theory | 2015-09-29 | Paper |
Randomized adaptive test cover
Lecture Notes in Computer Science | 2015-09-21 | Paper |
Finding and enumerating large intersections
Theoretical Computer Science | 2015-05-18 | Paper |
Parameterizations of hitting set of bundles and inverse scope
Journal of Combinatorial Optimization | 2015-05-11 | Paper |
Editing simple graphs
Journal of Graph Algorithms and Applications | 2015-01-15 | Paper |
Strict group testing and the set basis problem
Journal of Combinatorial Theory. Series A | 2014-06-03 | Paper |
Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
Information Processing Letters | 2014-04-17 | Paper |
Editing the simplest graphs
Algorithms and Computation | 2014-02-18 | Paper |
Cluster editing with locally bounded modifications revisited
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
Theoretical Computer Science | 2014-01-13 | Paper |
Two new perspectives on multi-stage group testing
Algorithmica | 2013-11-11 | Paper |
A toolbox for provably optimal multistage strict group testing strategies
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Fixed-parameter tractability of error correction in graphical linear systems
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Even faster parameterized cluster deletion and cluster editing
Information Processing Letters | 2013-04-04 | Paper |
Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover
Discrete Optimization | 2012-10-16 | Paper |
Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover
Theoretical Computer Science | 2012-10-11 | Paper |
Bounds for nonadaptive group tests to estimate the amount of defectives
Discrete Mathematics, Algorithms and Applications | 2012-08-27 | Paper |
A note on the parameterized complexity of unordered maximum tree orientation
Discrete Applied Mathematics | 2012-06-18 | Paper |
Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
Parameterized and Exact Computation | 2012-06-15 | Paper |
Randomized group testing both query-optimal and minimal adaptive
SOFSEM 2012: Theory and Practice of Computer Science | 2012-06-15 | Paper |
| scientific article; zbMATH DE number 5957368 (Why is no real title available?) | 2011-10-12 | Paper |
Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries
Networks | 2011-08-16 | Paper |
Parameterized Reductions and Algorithms for Another Vertex Cover Generalization
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Bounds for nonadaptive group tests to estimate the amount of defectives
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
Competitive group testing and learning hidden vertex covers with minimum adaptivity
Discrete Mathematics, Algorithms and Applications | 2010-12-15 | Paper |
Homogeneous string segmentation using trees and weighted independent sets
Algorithmica | 2010-05-28 | Paper |
Fixed-parameter enumerability of cluster editing and related problems
Theory of Computing Systems | 2010-05-10 | Paper |
Fast perfect phylogeny haplotype inference.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
Information Processing Letters | 2010-01-29 | Paper |
Bounded-degree techniques accelerate some parameterized graph algorithms
Parameterized and Exact Computation | 2010-01-14 | Paper |
Pareto complexity of two-parameter FPT problems: a case study for partial vertex cover
Parameterized and Exact Computation | 2010-01-14 | Paper |
The union of minimal hitting sets: parameterized combinatorial bounds and counting
Journal of Discrete Algorithms | 2009-12-10 | Paper |
Multiple hypernode hitting sets and smallest two-cores with targets
Journal of Combinatorial Optimization | 2009-12-02 | Paper |
Online search with time-varying price bounds
Algorithmica | 2009-10-23 | Paper |
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Fundamentals of Computation Theory | 2009-10-20 | Paper |
Ranking hypotheses to minimize the search cost in probabilistic inference models
Discrete Applied Mathematics | 2009-06-23 | Paper |
Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Threshold Group Testing
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Segmenting Strings Homogeneously Via Trees
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
Scheduling search procedures
Journal of Scheduling | 2007-12-20 | Paper |
The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting
STACS 2007 | 2007-09-03 | Paper |
Threshold Group Testing
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Scheduling search procedures: The wheel of fortune
Journal of Scheduling | 2007-05-15 | Paper |
Fixed-Parameter Tractable Generalizations of Cluster Editing
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Overlaps help: Improved bounds for group testing with interval queries
Discrete Applied Mathematics | 2007-03-02 | Paper |
Fast algorithms for finding disjoint subsequences with extremal densities
Pattern Recognition | 2006-11-15 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Multiple spin-block decisions
Algorithmica | 2006-06-14 | Paper |
Randomized vs. deterministic distance query strategies for point location on the line
Discrete Applied Mathematics | 2006-04-28 | Paper |
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
Theoretical Computer Science | 2006-04-06 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Computational Science – ICCS 2005
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Parameterized and Exact Computation
Lecture Notes in Computer Science | 2005-08-23 | Paper |
On queuing lengths in on-line switching
Theoretical Computer Science | 2005-06-30 | Paper |
| scientific article; zbMATH DE number 2089217 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2086629 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2083810 (Why is no real title available?) | 2004-08-06 | Paper |
Approximate location of relevant variables under the crossover distribution.
Discrete Applied Mathematics | 2004-02-14 | Paper |
Powers of geometric intersection graphs and dispersion algorithms
Discrete Applied Mathematics | 2003-12-04 | Paper |
On parallel attribute-efficient learning.
Journal of Computer and System Sciences | 2003-08-19 | Paper |
Nearly optimal strategies for special cases of on-line capital investment.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1962841 (Why is no real title available?) | 2003-08-11 | Paper |
Linear-time recognition of bipartite graphs plus two edges
Discrete Mathematics | 2003-04-28 | Paper |
Point placement on the line by distance data.
Discrete Applied Mathematics | 2003-04-28 | Paper |
Two short notes on the on-line travelling salesman: handling times and lookahead.
Theoretical Computer Science | 2003-01-21 | Paper |
Online strategies for backups
Theoretical Computer Science | 2002-08-05 | Paper |
| scientific article; zbMATH DE number 1775448 (Why is no real title available?) | 2002-08-01 | Paper |
Optimizing a mail-order with discount and shipping costs
Information Processing Letters | 2002-07-14 | Paper |
| scientific article; zbMATH DE number 1696526 (Why is no real title available?) | 2002-07-09 | Paper |
| scientific article; zbMATH DE number 1760013 (Why is no real title available?) | 2002-06-25 | Paper |
| scientific article; zbMATH DE number 1629848 (Why is no real title available?) | 2001-11-06 | Paper |
Minus domination in small-degree graphs
Discrete Applied Mathematics | 2001-11-01 | Paper |
| scientific article; zbMATH DE number 1629982 (Why is no real title available?) | 2001-10-23 | Paper |
Degree-preserving spanning trees in small-degree graphs
Discrete Mathematics | 2001-08-02 | Paper |
| scientific article; zbMATH DE number 1617283 (Why is no real title available?) | 2001-07-11 | Paper |
Adaptive versus nonadaptive attribute-efficient learning
Machine Learning | 2001-01-16 | Paper |
| scientific article; zbMATH DE number 1444319 (Why is no real title available?) | 2000-05-09 | Paper |
| scientific article; zbMATH DE number 1262784 (Why is no real title available?) | 1999-04-28 | Paper |
An optimal parallel algorithm for digital curve segmentation
Theoretical Computer Science | 1998-07-22 | Paper |
| scientific article; zbMATH DE number 995880 (Why is no real title available?) | 1997-04-01 | Paper |
A parallel algorithm for nearly optimal edge search
Information Processing Letters | 1997-02-27 | Paper |
The linear time recognition of digital arcs
Pattern Recognition Letters | 1996-04-16 | Paper |
The parallel solution of domination problems on chordal and strongly chordal graphs
Discrete Applied Mathematics | 1994-09-27 | Paper |
Dominating cliques in chordal graphs
Discrete Mathematics | 1994-09-15 | Paper |
PLA folding in special graph classes
Discrete Applied Mathematics | 1994-07-31 | Paper |
A tight upper bound for group testing in graphs
Discrete Applied Mathematics | 1994-05-15 | Paper |
Paths in interval graphs and circular arc graphs
Discrete Mathematics | 1993-08-30 | Paper |
| scientific article; zbMATH DE number 219249 (Why is no real title available?) | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 139780 (Why is no real title available?) | 1993-03-28 | Paper |
Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
Order | 1993-01-16 | Paper |
Distances in cocomparability graphs and their powers
Discrete Applied Mathematics | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 15355 (Why is no real title available?) | 1992-06-25 | Paper |
Irredundance number versus domination number
Discrete Mathematics | 1992-06-25 | Paper |
Domination in convex and chordal bipartite graphs
Information Processing Letters | 1990-01-01 | Paper |
Induced subgraphs and well‐quasi‐ordering
Journal of Graph Theory | 1990-01-01 | Paper |
The Hamiltonian circuit problem for circle graphs is NP-complete
Information Processing Letters | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 3997861 (Why is no real title available?) | 1985-01-01 | Paper |
