| Publication | Date of Publication | Type |
|---|
Introduction to routing problems with mandatory transitions
Lecture Notes in Computer Science | 2023-08-14 | Paper |
On the complexity of independent dominating set with obligations in graphs
Theoretical Computer Science | 2022-02-01 | Paper |
Graph problems with obligations
| 2019-10-11 | Paper |
Total domination, connected vertex cover and Steiner tree with conflicts
| 2018-12-10 | Paper |
Domination problems with no conflicts
Discrete Applied Mathematics | 2018-05-24 | Paper |
On the discovery of graphs and graph algorithms
| 2017-03-03 | Paper |
Some Hamiltonian properties of one-conflict graphs
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Nash-Williams-type and Chvátal-type conditions in one-conflict graphs
Lecture Notes in Computer Science | 2015-02-20 | Paper |
An exact algorithm to check the existence of (elementary) paths and a generalisation of the cut problem in graphs with forbidden transitions
Lecture Notes in Computer Science | 2014-11-04 | Paper |
Analytical and experimental comparison of six algorithms for the vertex cover problem
| 2014-04-01 | Paper |
Solving the minimum independent domination set problem in graphs by exact algorithm and greedy heuristic
RAIRO - Operations Research | 2014-02-24 | Paper |
New approximation algorithms for the vertex cover problem
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Analysis and comparison of three algorithms for the vertex cover problem on large graphs with low memory capacities
Algorithmic Operations Research | 2013-12-11 | Paper |
Trees in graphs with conflict edges or forbidden transitions
Lecture Notes in Computer Science | 2013-05-28 | Paper |
A new lower bound on the independence number of graphs
Discrete Applied Mathematics | 2013-04-18 | Paper |
Mean analysis of an online algorithm for the vertex cover problem
Information Processing Letters | 2010-08-16 | Paper |
A better list heuristic for vertex cover
Information Processing Letters | 2010-04-19 | Paper |
Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
Information Processing Letters | 2009-07-09 | Paper |
AN OPTIMAL REBUILDING STRATEGY FOR AN INCREMENTAL TREE PROBLEM
Journal of Interconnection Networks | 2009-06-30 | Paper |
An Optimal Rebuilding Strategy for a Decremental Tree Problem
Structural Information and Communication Complexity | 2009-03-12 | Paper |
Bicriteria scheduling for contiguous and non contiguous parallel tasks
Annals of Operations Research | 2008-09-03 | Paper |
Constructing incremental sequences in graphs
| 2007-08-13 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
scientific article; zbMATH DE number 2090665 (Why is no real title available?)
| 2004-08-12 | Paper |
Edge-disjoint spanners of complete bipartite graphs
Discrete Mathematics | 2002-03-29 | Paper |
Scattering and multi-scattering in trees and meshes, with local routing and without buffering
Parallel Computing | 2000-01-12 | Paper |
Edge-disjoint spanners of complete graphs and complete digraphs
Discrete Mathematics | 1999-12-20 | Paper |
Broadcast and gossip in line-communication mode
Discrete Applied Mathematics | 1998-11-01 | Paper |
Minimum gossip bus networks
| 1996-11-25 | Paper |
