| Publication | Date of Publication | Type |
|---|
Finding an antidirected Hamiltonian path starting with a forward arc from a given vertex of a tournament
| 2024-07-05 | Paper |
On the parallel complexity of the alternating Hamiltonian cycle problem
| 2024-07-05 | Paper |
NC algorithms for antidirected hamiltonian paths and cycles in tournaments
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Scheduling independent multiprocessor tasks
1477.68043 | 2021-12-20 | Paper |
Tropical paths in vertex-colored graphs
Journal of Combinatorial Optimization | 2021-11-25 | Paper |
Weak balance in random signed graphs
Internet Mathematics | 2021-04-26 | Paper |
On the number of vertex-disjoint cycles in digraphs
SIAM Journal on Discrete Mathematics | 2019-12-11 | Paper |
Safe sets, network majority on weighted trees
Networks | 2019-08-12 | Paper |
Safe sets in graphs: graph classes and structural parameters
Journal of Combinatorial Optimization | 2018-12-06 | Paper |
Maximum colorful cycles in vertex-colored graphs
| 2018-11-28 | Paper |
Maximum colorful independent sets in vertex-colored graphs
| 2018-10-11 | Paper |
Maximum colorful cliques in vertex-colored graphs
| 2018-10-04 | Paper |
Tropical dominating sets in vertex-coloured graphs
Journal of Discrete Algorithms | 2018-05-09 | Paper |
Tropical matchings in vertex-colored graphs
| 2018-04-09 | Paper |
Tropical paths in vertex-colored graphs
Combinatorial Optimization and Applications | 2018-03-26 | Paper |
Proper Hamiltonian paths in edge-coloured multigraphs
Graphs and Combinatorics | 2017-10-11 | Paper |
The complexity of tropical graph homomorphisms
Discrete Applied Mathematics | 2017-07-27 | Paper |
Proper Hamiltonian cycles in edge-colored multigraphs
Discrete Mathematics | 2017-05-22 | Paper |
Network majority on tree topological network
| 2017-02-13 | Paper |
Safe sets in graphs: graph classes and structural parameters
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Connected tropical subgraphs in vertex-colored graphs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2016-08-23 | Paper |
Partitioning a graph into highly connected subgraphs
Journal of Graph Theory | 2016-08-12 | Paper |
Tropical dominating sets in vertex-coloured graphs
Lecture Notes in Computer Science | 2016-05-03 | Paper |
On degree sets and the minimum orders in bipartite graphs
Discussiones Mathematicae Graph Theory | 2014-05-16 | Paper |
Proper Hamiltonian paths in edge-colored multigraphs
| 2013-11-01 | Paper |
Balance in random signed graphs
Internet Mathematics | 2013-02-15 | Paper |
Proper connection of graphs
Discrete Mathematics | 2012-08-10 | Paper |
Sufficient conditions for the existence of spanning colored trees in edge-colored graphs
Discrete Mathematics | 2012-08-10 | Paper |
Links in edge-colored graphs
European Journal of Combinatorics | 2010-04-27 | Paper |
Longest cycles in 3-connected graphs with given independence number
Graphs and Combinatorics | 2009-12-09 | Paper |
Bipartite Graphs and their Degree Sets
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Further results on degree sets for graphs
AKCE International Journal of Graphs and Combinatorics | 2005-05-03 | Paper |
On max cut in cubic graphs
| 2003-06-29 | Paper |
The number of 2-edge-colored complete graphs with unique Hamiltonian alternating cycle
Discrete Mathematics | 2003-04-09 | Paper |
Scheduling independent multiprocessor tasks
Algorithmica | 2002-03-07 | Paper |
Ramsey numbers for tournaments
Theoretical Computer Science | 2001-08-20 | Paper |
Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases
RAIRO - Theoretical Informatics and Applications | 2001-04-26 | Paper |
scientific article; zbMATH DE number 1500552 (Why is no real title available?)
| 2001-03-07 | Paper |
On the parallel complexity of the alternating Hamiltonian cycle problem
RAIRO - Operations Research | 2000-08-24 | Paper |
A sufficient condition for maximum cycles in bipartite digraphs
Discrete Mathematics | 2000-03-02 | Paper |
A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors: Short communication: Special issue on task sheduling problems on parallel and distributed systems
Parallel Computing | 1999-04-28 | Paper |
scientific article; zbMATH DE number 1034100 (Why is no real title available?)
| 1997-07-15 | Paper |
Minimal colorings for properly colored subgraphs
Graphs and Combinatorics | 1997-02-11 | Paper |
scientific article; zbMATH DE number 927063 (Why is no real title available?)
| 1997-01-28 | Paper |
Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results
RAIRO - Operations Research | 1997-01-07 | Paper |
The forwarding index of directed networks
Discrete Applied Mathematics | 1996-10-09 | Paper |
Minimum \((2,r)\)-metrics and integer multiflows
European Journal of Combinatorics | 1996-07-03 | Paper |
scientific article; zbMATH DE number 845478 (Why is no real title available?)
| 1996-02-25 | Paper |
Weakly hamiltonian-connected vertices in bipartite tournaments
Journal of Combinatorial Theory. Series B | 1995-07-02 | Paper |
Alternating paths in edge-colored complete graphs
Discrete Applied Mathematics | 1995-05-04 | Paper |
Packing problems in edge-colored graphs
Discrete Applied Mathematics | 1995-02-14 | Paper |
scientific article; zbMATH DE number 718675 (Why is no real title available?)
| 1995-02-02 | Paper |
Computation of the forwarding index via flows: A note
Networks | 1994-09-05 | Paper |
Cycles through \(k\) vertices in bipartite tournaments
Combinatorica | 1994-08-11 | Paper |
Grids in random graphs
Random Structures & Algorithms | 1994-07-20 | Paper |
Complementary cycles containing a fixed arc in diregular bipartite tournaments
Discrete Mathematics | 1994-01-01 | Paper |
The forwarding index of communication networks with given connectivity
Discrete Applied Mathematics | 1993-01-16 | Paper |
Hamiltonian paths and cycles, number of arcs and independence number in digraphs
Discrete Mathematics | 1993-01-16 | Paper |
A linear-time algorithm for finding Hamiltonian cycles in tournaments
Discrete Applied Mathematics | 1992-09-27 | Paper |
scientific article; zbMATH DE number 54804 (Why is no real title available?)
| 1992-09-26 | Paper |
Directed hamiltonian graphs
Journal of Graph Theory | 1992-06-28 | Paper |
A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs
Journal of Algorithms | 1992-06-28 | Paper |
Cycles and paths of many lengths in bipartite digraphs
Journal of Combinatorial Theory. Series B | 1990-01-01 | Paper |
\(k\)-linked and \(k\)-cyclic digraphs
Journal of Combinatorial Theory. Series B | 1990-01-01 | Paper |
Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments
SIAM Journal on Discrete Mathematics | 1990-01-01 | Paper |
Cycles and paths in bipartite tournaments with spanning configurations
Combinatorica | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4177106 (Why is no real title available?)
| 1989-01-01 | Paper |
scientific article; zbMATH DE number 4158647 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4059432 (Why is no real title available?)
| 1988-01-01 | Paper |
