| Publication | Date of Publication | Type |
|---|
| Zero-visibility cops and robber game on cage graph | 2024-09-16 | Paper |
| Parameterized algorithms for cluster vertex deletion on degree-4 graphs and general graphs | 2024-08-22 | Paper |
The zero-visibility cops and robber game on graph products
Theoretical Computer Science | 2024-06-28 | Paper |
Edge searching and fast searching with constraints
Theoretical Computer Science | 2024-03-01 | Paper |
New results on the zero-visibility cops and robber game
Algorithmic Aspects in Information and Management | 2024-02-23 | Paper |
A better subgraph of the minimum weight triangulation
Lecture Notes in Computer Science | 2023-12-12 | Paper |
Fast searching on \(k\)-combinable graphs
Algorithmic Aspects in Information and Management | 2023-07-07 | Paper |
Fast searching on cactus graphs
Journal of Combinatorial Optimization | 2023-04-17 | Paper |
| Aggregating preferences represented by conditional preference networks | 2023-03-31 | Paper |
One-visibility cops and robber on trees: optimal cop-win strategies
Theoretical Computer Science | 2022-10-07 | Paper |
A simple method for proving lower bounds in the zero-visibility cops and robber game
Journal of Combinatorial Optimization | 2022-07-18 | Paper |
| Computing the one-visibility cop-win strategies for trees | 2022-06-29 | Paper |
The one-cop-moves game on planar graphs
Journal of Combinatorial Optimization | 2021-11-25 | Paper |
Four-searchable biconnected outerplanar graphs
Discrete Applied Mathematics | 2021-11-11 | Paper |
One-visibility cops and robber on trees
Theoretical Computer Science | 2021-10-06 | Paper |
| Computing the one-visibility copnumber of trees | 2021-07-05 | Paper |
Properties of a \(q\)-analogue of zero forcing
Graphs and Combinatorics | 2021-02-16 | Paper |
Correction to: ``Properties of a \(q\)-analogue of zero forcing
Graphs and Combinatorics | 2021-02-16 | Paper |
Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
Special Matrices | 2021-01-14 | Paper |
The one-cop-moves game on graphs with some special structures
Theoretical Computer Science | 2020-11-06 | Paper |
On a homogeneous recurrence relation for the determinants of general pentadiagonal Toeplitz matrices
Computers & Mathematics with Applications | 2020-10-11 | Paper |
| The one-cop-moves game on graphs of small treewidth | 2020-05-13 | Paper |
Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
Special Matrices | 2020-02-26 | Paper |
| A partition approach to lower bounds for zero-visibility cops and robber | 2020-02-25 | Paper |
Positive semidefinite zero forcing numbers of two classes of graphs
Theoretical Computer Science | 2019-08-20 | Paper |
Positive zero forcing and edge clique coverings
Frontiers in Algorithmics | 2019-04-26 | Paper |
A New Lower Bound for Positive Zero Forcing
Frontiers in Algorithmics | 2019-04-26 | Paper |
The fast search number of a complete \(k\)-partite graph
Algorithmica | 2018-10-18 | Paper |
Ovoids of generalized quadrangles of order and Delsarte cocliques in related strongly regular graphs
Journal of Combinatorial Designs | 2018-10-05 | Paper |
Compressed cliques graphs, clique coverings and positive zero forcing
Theoretical Computer Science | 2018-06-05 | Paper |
The cop number of the one-cop-moves game on planar graphs
(available as arXiv preprint) | 2018-03-26 | Paper |
Infection in hypergraphs
Discrete Applied Mathematics | 2018-02-22 | Paper |
Infection in hypergraphs
Discrete Applied Mathematics | 2018-02-22 | Paper |
| Genomic scaffold filling revisited | 2017-10-17 | Paper |
Fast searching on Cartesian products of graphs
Lecture Notes in Computer Science | 2017-05-19 | Paper |
The fast search number of a Cartesian product of graphs
Discrete Applied Mathematics | 2017-05-15 | Paper |
Lower bounds for positive semidefinite zero forcing and their applications
Journal of Combinatorial Optimization | 2017-03-03 | Paper |
Fast searching on complete \(k\)-partite graphs
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Triangulations without minimum-weight drawing
Information Processing Letters | 2016-06-16 | Paper |
On the complexity of the positive semidefinite zero forcing number
Linear Algebra and its Applications | 2016-02-12 | Paper |
Improved parameterized and exact algorithms for cut problems on trees
Theoretical Computer Science | 2015-12-11 | Paper |
The complexity of zero-visibility cops and robber
Theoretical Computer Science | 2015-12-08 | Paper |
Positive semidefinite zero forcing: complexity and lower bounds
Lecture Notes in Computer Science | 2015-10-30 | Paper |
The complexity of the positive semidefinite zero forcing
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Algorithms for cut problems on trees
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
The optimal capture time of the one-cop-moves game
Theoretical Computer Science | 2015-06-11 | Paper |
Zero-visibility cops and robber and the pathwidth of a graph
Journal of Combinatorial Optimization | 2015-05-11 | Paper |
A polynomial-time algorithm for computing the resilience of arrangements of ray sensors
International Journal of Computational Geometry & Applications | 2015-04-22 | Paper |
Generalizing labeled and unlabeled sample compression to multi-label concept classes
Lecture Notes in Computer Science | 2015-01-14 | Paper |
Algebraic methods proving Sauer's bound for teaching complexity
Theoretical Computer Science | 2014-10-31 | Paper |
The complexity of zero-visibility cops and robber
Frontiers in Algorithmics | 2014-09-02 | Paper |
On the approximability of the exemplar adjacency number problem for genomes with gene repetitions
Theoretical Computer Science | 2014-08-26 | Paper |
Zero-visibility cops and robber game on a graph
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2014-04-03 | Paper |
Fast-mixed searching and related problems on graphs
Theoretical Computer Science | 2014-01-16 | Paper |
Euclidean chains and their shortcuts
Theoretical Computer Science | 2014-01-10 | Paper |
Fast-mixed searching on graphs
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
Sauer's bound for a notion of teaching complexity
Lecture Notes in Computer Science | 2012-10-16 | Paper |
Fast searching games on graphs
Journal of Combinatorial Optimization | 2012-04-04 | Paper |
Parameterized complexity of even/odd subgraph problems
Journal of Discrete Algorithms | 2011-08-23 | Paper |
Exponential and polynomial time algorithms for the minimum common string partition problem
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
Euclidean chains and their shortcuts
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
On the red/blue spanning tree problem
Theoretical Computer Science | 2011-05-18 | Paper |
Fast edge searching and fast searching on graphs
Theoretical Computer Science | 2011-03-14 | Paper |
Fast edge-searching and related problems
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
Parameterized complexity of even/odd subgraph problems
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Lower bounds on fast searching
Algorithms and Computation | 2009-12-17 | Paper |
Sweeping graphs with large clique number
Discrete Mathematics | 2009-12-15 | Paper |
Standard directed search strategies and their applications
Journal of Combinatorial Optimization | 2009-07-10 | Paper |
On the Red/Blue Spanning Tree Problem
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Lower Bounds on Edge Searching
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies | 2009-03-03 | Paper |
Searching Cycle-Disjoint Graphs
Combinatorial Optimization and Applications | 2009-03-03 | Paper |
Arc Searching Digraphs Without Jumping
Combinatorial Optimization and Applications | 2009-03-03 | Paper |
Monotonicity in digraph search problems
Theoretical Computer Science | 2008-11-18 | Paper |
Digraph searching, directed vertex separation and directed pathwidth
Discrete Applied Mathematics | 2008-09-10 | Paper |
On the Monotonicity of Weak Searching
Lecture Notes in Computer Science | 2008-07-10 | Paper |
On the Fast Searching Problem
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Time constrained graph searching
Theoretical Computer Science | 2008-06-24 | Paper |
Searching Trees with Sources and Targets
Frontiers in Algorithmics | 2008-06-19 | Paper |
Non-breaking Similarity of Genomes with Gene Repetitions
Combinatorial Pattern Matching | 2008-06-17 | Paper |
| On the tileability of polygons with colored dominoes | 2008-05-27 | Paper |
Monotonicity of strong searching on digraphs
Journal of Combinatorial Optimization | 2008-04-23 | Paper |
Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
Lecture Notes in Computer Science | 2008-04-15 | Paper |
An Efficient Algorithm for Inference in Rough Set Flow Graphs
Lecture Notes in Computer Science | 2008-03-19 | Paper |
Digraph Strong Searching: Monotonicity and Complexity
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Directed Searching Digraphs: Monotonicity and Complexity
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Strong-mixed searching and pathwidth
Journal of Combinatorial Optimization | 2007-02-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
| scientific article; zbMATH DE number 2185620 (Why is no real title available?) | 2005-07-04 | Paper |
Minimal tetrahedralizations of a class of polyhedra
Journal of Combinatorial Optimization | 2004-11-22 | Paper |
Detecting tetrahedralizations of a set of line segments
Journal of Algorithms | 2004-11-12 | Paper |
Solution of an outstanding conjecture: the non-existence of universal cycles with \(k=n-2\)
Discrete Mathematics | 2002-12-02 | Paper |
A lower bound for \(\beta\)-skeleton belonging to minimum weight triangulations
Computational Geometry | 2002-08-14 | Paper |
Maximum weight triangulation and graph drawing
Information Processing Letters | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1696645 (Why is no real title available?) | 2002-07-01 | Paper |
| scientific article; zbMATH DE number 1629854 (Why is no real title available?) | 2001-11-06 | Paper |
On some polyhedra covering problems
Journal of Combinatorial Optimization | 2001-01-25 | Paper |
| scientific article; zbMATH DE number 1555960 (Why is no real title available?) | 2001-01-24 | Paper |
The class Steiner minimal tree problem: A lower bound and test problem generation
Acta Informatica | 2001-01-03 | Paper |
| scientific article; zbMATH DE number 1382284 (Why is no real title available?) | 2000-02-15 | Paper |
| scientific article; zbMATH DE number 1348802 (Why is no real title available?) | 1999-10-07 | Paper |
| scientific article; zbMATH DE number 1348909 (Why is no real title available?) | 1999-10-07 | Paper |
| scientific article; zbMATH DE number 1222816 (Why is no real title available?) | 1999-03-30 | Paper |
| scientific article; zbMATH DE number 1131980 (Why is no real title available?) | 1998-12-10 | Paper |
| scientific article; zbMATH DE number 1172337 (Why is no real title available?) | 1998-07-07 | Paper |
| scientific article; zbMATH DE number 1150371 (Why is no real title available?) | 1998-05-07 | Paper |
| scientific article; zbMATH DE number 991594 (Why is no real title available?) | 1997-05-20 | Paper |
A successive quadratic programming method that uses new corrections for search directions
Journal of Computational and Applied Mathematics | 1997-02-24 | Paper |
| scientific article; zbMATH DE number 872654 (Why is no real title available?) | 1996-09-26 | Paper |
A recursive quadric programming algorithm that uses new nondifferentiable penalty functions
Applied Mathematics. Series B (English Edition) | 1994-10-24 | Paper |
| scientific article; zbMATH DE number 621945 (Why is no real title available?) | 1994-09-27 | Paper |
