| Publication | Date of Publication | Type |
|---|
Finding all stable matchings with assignment constraints
Games and Economic Behavior | 2025-01-17 | Paper |
On \(k\)-anti-traceability of oriented graphs
Discrete Mathematics | 2025-01-08 | Paper |
Bounds on maximum weight directed cut
SIAM Journal on Discrete Mathematics | 2024-09-17 | Paper |
Note on disjoint cycles in multipartite tournaments
Discrete Mathematics | 2024-07-10 | Paper |
Public goods in networks with constraints on sharing
Journal of Economic Theory | 2024-06-28 | Paper |
Convergence and correctness of belief propagation for weighted min-max flow
Discrete Applied Mathematics | 2024-06-20 | Paper |
On Seymour's and Sullivan's second neighbourhood conjectures
Journal of Graph Theory | 2024-01-30 | Paper |
Note on Disjoint Cycles in Multipartite Tournaments
| 2023-11-22 | Paper |
Component order connectivity in directed graphs
| 2023-11-13 | Paper |
Perfect forests in graphs and their extensions
Journal of Graph Theory | 2023-10-05 | Paper |
Kings in multipartite hypertournaments
Journal of Graph Theory | 2023-10-04 | Paper |
Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments
Journal of Graph Theory | 2023-09-29 | Paper |
\((1,1)\)-cluster editing is polynomial-time solvable
Discrete Applied Mathematics | 2023-09-14 | Paper |
Unique stable matchings
Games and Economic Behavior | 2023-08-23 | Paper |
scientific article; zbMATH DE number 7724227 (Why is no real title available?)
| 2023-08-08 | Paper |
Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem
| 2023-07-03 | Paper |
Lower Bounds for Maximum Weighted Cut
SIAM Journal on Discrete Mathematics | 2023-06-22 | Paper |
Results on the small quasi-kernel conjecture
Discrete Mathematics | 2023-05-15 | Paper |
Evaluation of The Contract Or-Patch Heuristic Eor The Asymmetric Tsp1
INFOR: Information Systems and Operational Research | 2023-05-05 | Paper |
Bounds on Maximum Weight Directed Cut
| 2023-04-20 | Paper |
Preference swaps for the stable matching problem
Theoretical Computer Science | 2023-04-20 | Paper |
Exact capacitated domination: on the computational complexity of uniqueness
Discrete Applied Mathematics | 2023-04-17 | Paper |
Fixed parameterized algorithms for generalized feedback vertex set problems
Theoretical Computer Science | 2023-03-24 | Paper |
scientific article; zbMATH DE number 7650904 (Why is no real title available?)
| 2023-02-07 | Paper |
Constructing edge-disjoint Steiner trees in Cartesian product networks
| 2023-01-26 | Paper |
\(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms
Journal of Computer and System Sciences | 2023-01-06 | Paper |
Proper orientation, proper biorientation and semi-proper orientation numbers of graphs
Journal of Combinatorial Optimization | 2023-01-04 | Paper |
Smallest number of vertices in a 2-arc-strong digraph without good pairs
Theoretical Computer Science | 2022-10-21 | Paper |
Extended path partition conjecture for semicomplete and acyclic compositions
Discrete Mathematics | 2022-08-24 | Paper |
Component order connectivity in directed graphs
Algorithmica | 2022-08-18 | Paper |
Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
The smallest number of vertices in a 2-arc-strong digraph without pair of arc-disjoint in- and out-branchings
| 2022-06-29 | Paper |
On \(d\)-panconnected tournaments with large semidegrees
Discrete Mathematics | 2022-05-27 | Paper |
Proper orientation number of triangle-free bridgeless outerplanar graphs
Journal of Graph Theory | 2022-03-31 | Paper |
Arc-disjoint strong spanning subdigraphs of semicomplete compositions
Journal of Graph Theory | 2022-03-31 | Paper |
r -Simple k -Path and Related Problems Parameterized by k / r
ACM Transactions on Algorithms | 2022-02-08 | Paper |
Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs
| 2022-01-22 | Paper |
Preference Swaps for the Stable Matching Problem
| 2021-12-31 | Paper |
Parameterized constraint satisfaction problems: a survey
| 2021-06-15 | Paper |
Uniqueness of \(DP\)-Nash subgraphs and \(D\)-sets in weighted graphs of Netflix games
| 2021-04-21 | Paper |
Parameterized pre-coloring extension and list coloring problems
SIAM Journal on Discrete Mathematics | 2021-03-30 | Paper |
Proximity and remoteness in directed and undirected graphs
Discrete Mathematics | 2021-01-27 | Paper |
The smallest number of vertices in a 2-arc-strong digraph which has no good pair
| 2020-12-07 | Paper |
\(k\)-distinct in- and out-branchings in digraphs
| 2020-05-27 | Paper |
Path-contractions, edge deletions and connectivity preservation
| 2020-05-27 | Paper |
Note on semi-proper orientations of outerplanar graphs
| 2020-04-15 | Paper |
Exact capacitated domination: on the computational complexity of uniqueness
| 2020-03-16 | Paper |
Alternative parameterizations of \textsc{Metric Dimension}
Theoretical Computer Science | 2020-01-16 | Paper |
Parameterized resiliency problems
Theoretical Computer Science | 2019-10-18 | Paper |
On \(r\)-simple \(k\)-path and related problems parameterized by \(k/r\)
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Pattern-based approach to the workflow satisfiability problem with user-independent constraints
Journal of Artificial Intelligence Research | 2019-09-13 | Paper |
Branching in digraphs with many and few leaves: structural and algorithmic results
| 2019-07-25 | Paper |
Clustering without replication in combinatorial circuits
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
Acyclic digraphs
Springer Monographs in Mathematics | 2019-03-04 | Paper |
Basic Terminology, Notation and Results
Springer Monographs in Mathematics | 2019-03-04 | Paper |
Path-contractions, edge deletions and connectivity preservation
Journal of Computer and System Sciences | 2019-01-25 | Paper |
Strong Subgraph Connectivity of Digraphs: A Survey
| 2018-08-08 | Paper |
Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials
Journal of Computer and System Sciences | 2018-05-08 | Paper |
\(k\)-distinct in- and out-branchings in digraphs
Journal of Computer and System Sciences | 2018-05-08 | Paper |
Strong subgraph $k$-arc-connectivity
| 2018-05-04 | Paper |
Strong subgraph $k$-connectivity bounds
| 2018-03-01 | Paper |
Note on maximal bisection above tight lower bound
Information Processing Letters | 2017-11-03 | Paper |
Parameterized resiliency problems via integer linear programming
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Note on Perfect Forests in Digraphs
Journal of Graph Theory | 2017-07-05 | Paper |
Seymour's second neighbourhood conjecture for quasi-transitive oriented graphs
| 2017-04-05 | Paper |
Odd properly colored cycles in edge-colored graphs
Discrete Mathematics | 2017-02-06 | Paper |
The mixed Chinese postman problem parameterized by pathwidth and treedepth
SIAM Journal on Discrete Mathematics | 2016-11-30 | Paper |
Parameterized complexity of the \(k\)-arc Chinese postman problem
Journal of Computer and System Sciences | 2016-11-14 | Paper |
A multivariate approach for checking resiliency in access control
Algorithmic Aspects in Information and Management | 2016-11-09 | Paper |
Algorithms for the workflow satisfiability problem engineered for counting constraints
Journal of Combinatorial Optimization | 2016-10-20 | Paper |
Rural postman parameterized by the number of components of required edges
Journal of Computer and System Sciences | 2016-09-16 | Paper |
Polynomial kernels and user reductions for the workflow satisfiability problem
Algorithmica | 2016-09-07 | Paper |
Note on Perfect Forests
Journal of Graph Theory | 2016-08-12 | Paper |
Linear-vertex kernel for the problem of packing \(r\)-stars into a graph without long induced paths
Information Processing Letters | 2016-04-06 | Paper |
Parameterizations of test cover with bounded test sizes
Algorithmica | 2016-03-23 | Paper |
Cryptographic enforcement of information flow policies without public information
Applied Cryptography and Network Security | 2016-03-10 | Paper |
Parameterized traveling salesman problem: beating the average
SIAM Journal on Discrete Mathematics | 2016-02-05 | Paper |
Tight lower bounds for the workflow satisfiability problem based on the strong exponential time hypothesis
Information Processing Letters | 2016-01-05 | Paper |
Pattern backtracking algorithm for the workflow satisfiability problem with user-independent constraints
Frontiers in Algorithmics | 2015-11-12 | Paper |
Polynomial kernels and user reductions for the workflow satisfiability problem
Parameterized and Exact Computation | 2015-09-15 | Paper |
Parameterized Complexity of the k-Arc Chinese Postman Problem
Algorithms - ESA 2014 | 2014-10-08 | Paper |
scientific article; zbMATH DE number 6297727 (Why is no real title available?)
| 2014-05-22 | Paper |
A new bound for 3-satisfiable MaxSat and its algorithmic application
Information and Computation | 2014-01-16 | Paper |
Parameterized complexity of \(k\)-Chinese postman problem
Theoretical Computer Science | 2014-01-13 | Paper |
Maximum balanced subgraph problem parameterized above lower bound
Theoretical Computer Science | 2014-01-13 | Paper |
Parameterized complexity of MaxSat above average
Theoretical Computer Science | 2014-01-13 | Paper |
Generalized traveling salesman problem reduction algorithms
Algorithmic Operations Research | 2013-12-11 | Paper |
Corrigendum to: ``The linear arrangement problem parameterized above guaranteed value
Theory of Computing Systems | 2013-12-02 | Paper |
Fixed-parameter tractability of satisfying beyond the number of variables
Theory and Applications of Satisfiability Testing – SAT 2012 | 2013-08-12 | Paper |
Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems
Electronic Notes in Discrete Mathematics | 2013-07-04 | Paper |
(Non-)existence of polynomial kernels for the test cover problem
Information Processing Letters | 2013-03-20 | Paper |
A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications
Algorithmica | 2012-11-21 | Paper |
Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming
Algorithmica | 2012-11-21 | Paper |
Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width
Discrete Applied Mathematics | 2012-10-26 | Paper |
Parameterized study of the test cover problem
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
An algorithm for finding input-output constrained convex sets in an acyclic digraph
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey
The Multivariate Algorithmic Revolution and Beyond | 2012-09-05 | Paper |
Simultaneously satisfying linear equations over \(\mathbb {F}_2\): MaxLin2 and Max-\(r\)-Lin2 parameterized above average
| 2012-08-31 | Paper |
Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
European Journal of Operational Research | 2012-08-16 | Paper |
Parameterized Eulerian strong component arc deletion problem on tournaments
Information Processing Letters | 2012-07-18 | Paper |
Parameterized complexity of MaxSat above average
Lecture Notes in Computer Science | 2012-06-29 | Paper |
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
Journal of Computer and System Sciences | 2012-05-11 | Paper |
Solving MAX-\(r\)-SAT above a tight lower bound
Algorithmica | 2011-11-07 | Paper |
Out-branchings with extremal number of leaves
| 2011-07-06 | Paper |
Local search heuristics for the multidimensional assignment problem
Journal of Heuristics | 2011-06-16 | Paper |
Vertex cover problem parameterized above and below tight bounds
Theory of Computing Systems | 2011-03-30 | Paper |
A probabilistic approach to problems parameterized above or below tight bounds
Journal of Computer and System Sciences | 2011-03-28 | Paper |
scientific article; zbMATH DE number 5870341 (Why is no real title available?)
| 2011-03-25 | Paper |
Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
European Journal of Operational Research | 2011-01-28 | Paper |
A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic application
Lecture Notes in Computer Science | 2010-12-07 | Paper |
Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming
Lecture Notes in Computer Science | 2010-12-07 | Paper |
Betweenness parameterized above tight lower bound
Journal of Computer and System Sciences | 2010-10-07 | Paper |
Digraphs. Theory, algorithms and applications
| 2010-09-13 | Paper |
All ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs
| 2010-06-07 | Paper |
A memetic algorithm for the generalized traveling salesman problem
Natural Computing | 2010-05-05 | Paper |
The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops
Discrete Applied Mathematics | 2010-05-05 | Paper |
On complexity of minimum leaf out-branching problem
Discrete Applied Mathematics | 2010-04-28 | Paper |
Spanning directed trees with many leaves
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
FPT algorithms and kernels for the directed \(k\)-leaf problem
Journal of Computer and System Sciences | 2010-02-12 | Paper |
Minimum cost homomorphism dichotomy for oriented cycles
Graphs and Combinatorics | 2010-01-18 | Paper |
Fixed-parameter algorithms in analysis of heuristics for extracting networks in linear programs
Parameterized and Exact Computation | 2010-01-14 | Paper |
A probabilistic approach to problems parameterized above or below tight bounds
Parameterized and Exact Computation | 2010-01-14 | Paper |
Properly coloured cycles and paths: Results and open problems
Graph Theory, Computational Intelligence and Thought | 2010-01-07 | Paper |
Local search heuristics for the multidimensional assignment problem
Graph Theory, Computational Intelligence and Thought | 2010-01-07 | Paper |
Algorithms for generating convex sets in acyclic digraphs
Journal of Discrete Algorithms | 2009-12-10 | Paper |
Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs
SIAM Journal on Discrete Mathematics | 2009-11-27 | Paper |
Minimum leaf out-branching and related problems
Theoretical Computer Science | 2009-11-04 | Paper |
On the number of connected convex subgraphs of a connected acyclic digraph
Discrete Applied Mathematics | 2009-06-30 | Paper |
Convex sets in acyclic digraphs
Order | 2009-05-04 | Paper |
Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems
Journal of Heuristics | 2009-03-31 | Paper |
scientific article; zbMATH DE number 5531978 (Why is no real title available?)
| 2009-03-24 | Paper |
An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Note on edge-colored graphs and digraphs without properly colored cycles
| 2009-01-15 | Paper |
Digraphs
Springer Monographs in Mathematics | 2009-01-12 | Paper |
Fixed-parameter complexity of minimum profile problems
Algorithmica | 2008-12-02 | Paper |
Tolerance-based Algorithms for the Traveling Salesman Problem
Mathematical Programming and Game Theory for Decision Making | 2008-12-01 | Paper |
Minimum cost homomorphisms to semicomplete multipartite digraphs
Discrete Applied Mathematics | 2008-09-29 | Paper |
Minimum Leaf Out-Branching Problems
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Minimum Cost Homomorphism Dichotomy for Oriented Cycles
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
A problem of finding an acceptable variant in generalized project networks
Journal of Applied Mathematics and Decision Sciences | 2008-07-01 | Paper |
Fixed-Parameter Complexity of Minimum Profile Problems
Parameterized and Exact Computation | 2008-06-03 | Paper |
A dichotomy for minimum cost graph homomorphisms
European Journal of Combinatorics | 2008-05-13 | Paper |
Better Algorithms and Bounds for Directed Maximum Leaf Problems
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems
Approximation and Online Algorithms | 2008-02-21 | Paper |
The linear arrangement problem parameterized above guaranteed value
Theory of Computing Systems | 2007-12-19 | Paper |
Parameterized Algorithms for Directed Maximum Leaf Problems
Automata, Languages and Programming | 2007-11-28 | Paper |
On-line bin packing with two item sizes
| 2007-08-13 | Paper |
The greedy algorithm for the symmetric TSP
| 2007-08-13 | Paper |
The Linear Arrangement Problem Parameterized Above Guaranteed Value
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Characterization of edge-colored complete graphs with properly colored Hamilton paths
Journal of Graph Theory | 2007-02-02 | Paper |
Note on upper bounds for TSP domination number
| 2007-01-18 | Paper |
Domination analysis for minimum multiprocessor scheduling
Discrete Applied Mathematics | 2007-01-09 | Paper |
Hamilton cycles in digraphs of unitary matrices
Discrete Mathematics | 2006-12-14 | Paper |
Multipartite tournaments with small number of cycles
| 2006-09-13 | Paper |
On \(n\)-partite tournaments with unique \(n\)-cycle
Graphs and Combinatorics | 2006-09-12 | Paper |
Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs
Discrete Optimization | 2006-06-30 | Paper |
Minimum cost and list homomorphisms to semicomplete digraphs
Discrete Applied Mathematics | 2006-06-09 | Paper |
Level of repair analysis and minimum cost homomorphisms of graphs
Discrete Applied Mathematics | 2006-06-09 | Paper |
Further extension of the TSP assign neighborhood
Journal of Heuristics | 2006-05-29 | Paper |
scientific article; zbMATH DE number 5010630 (Why is no real title available?)
| 2006-03-09 | Paper |
Algorithmic Applications in Management
Lecture Notes in Computer Science | 2005-11-30 | Paper |
When the greedy algorithm fails
Discrete Optimization | 2005-08-22 | Paper |
Kernels in planar digraphs
Journal of Computer and System Sciences | 2005-08-03 | Paper |
Batched bin packing
Discrete Optimization | 2005-06-01 | Paper |
When \(n\)-cycles in \(n\)-partite tournaments are longest cycles
Discrete Mathematics | 2005-02-22 | Paper |
Algorithms with large domination ratio
Journal of Algorithms | 2004-10-04 | Paper |
On the number of quasi-kernels in digraphs
Journal of Graph Theory | 2004-08-06 | Paper |
scientific article; zbMATH DE number 2064409 (Why is no real title available?)
| 2004-05-18 | Paper |
scientific article; zbMATH DE number 2064413 (Why is no real title available?)
| 2004-05-18 | Paper |
Extracting pure network submatrices in linear programs using signed graphs.
Discrete Applied Mathematics | 2004-03-14 | Paper |
Steiner type problems for digraphs that are locally semicomplete or extended semicomplete
Journal of Graph Theory | 2004-02-03 | Paper |
Domination analysis of combinatorial optimization problems.
Discrete Applied Mathematics | 2003-09-09 | Paper |
Upper bounds on ATSP neighborhood size.
Discrete Applied Mathematics | 2003-09-09 | Paper |
scientific article; zbMATH DE number 1933055 (Why is no real title available?)
| 2003-06-23 | Paper |
Almost minimum diameter orientations of semicomplete multipartite and extended digraphs
Graphs and Combinatorics | 2003-03-25 | Paper |
Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs
Graphs and Combinatorics | 2003-03-02 | Paper |
Orientations of digraphs almost preserving diameter
Discrete Applied Mathematics | 2002-08-29 | Paper |
scientific article; zbMATH DE number 1792587 (Why is no real title available?)
| 2002-08-29 | Paper |
Anti-matroids
Operations Research Letters | 2002-08-28 | Paper |
scientific article; zbMATH DE number 1764950 (Why is no real title available?)
| 2002-07-09 | Paper |
Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
Discrete Applied Mathematics | 2002-06-24 | Paper |
Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP
Discrete Applied Mathematics | 2002-05-15 | Paper |
Remarks on Hamiltonian digraphs
The Australasian Journal of Combinatorics | 2001-11-09 | Paper |
Exponential neighbourhood local search for the traveling salesman problem
Computers \& Operations Research | 2001-11-06 | Paper |
Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour
Computers \& Operations Research | 2001-09-23 | Paper |
Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs
Discrete Mathematics | 2001-06-04 | Paper |
Construction heuristics for the asymmetric TSP.
European Journal of Operational Research | 2001-03-28 | Paper |
TSP tour domination and Hamilton cycle decompositions of regular digraphs
Operations Research Letters | 2001-01-01 | Paper |
scientific article; zbMATH DE number 1463410 (Why is no real title available?)
| 2000-12-03 | Paper |
Note on alternating directed cycles
Discrete Mathematics | 2000-11-02 | Paper |
Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs
Discrete Mathematics | 2000-11-02 | Paper |
Upper domination and upper irredundance perfect graphs
Discrete Mathematics | 2000-11-02 | Paper |
A note on the cardinality of certain classes of unlabeled multipartite tournaments
Discrete Mathematics | 2000-11-02 | Paper |
Detecting embedded networks in LP using GUB structures and independent set algorithms
Computational Optimization and Applications | 2000-10-29 | Paper |
On the Hajós number of graphs
Discrete Mathematics | 2000-09-27 | Paper |
Kings in semicomplete multipartite digraphs
| 2000-09-24 | Paper |
scientific article; zbMATH DE number 1498519 (Why is no real title available?)
| 2000-08-31 | Paper |
Quasi-Hamiltonicity: A series of necessary conditions for a digraph to be Hamiltonian
Journal of Combinatorial Theory. Series B | 2000-06-25 | Paper |
On the complexity of hamiltonian path and cycle problems in certain classes of digraphs
Discrete Applied Mathematics | 2000-04-09 | Paper |
Generalizations of tournaments: A survey
| 1999-09-10 | Paper |
A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
| 1999-07-07 | Paper |
Properly coloured Hamiltonian paths in edge-coloured complete graphs
Discrete Applied Mathematics | 1998-10-19 | Paper |
scientific article; zbMATH DE number 1156581 (Why is no real title available?)
| 1998-08-31 | Paper |
scientific article; zbMATH DE number 1067836 (Why is no real title available?)
| 1998-03-02 | Paper |
Hamiltonian paths and cycles in hypertournaments
| 1997-12-17 | Paper |
Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments
Combinatorics, Probability and Computing | 1997-12-01 | Paper |
Alternating cycles and paths in edge-coloured multigraphs: A survey
Discrete Mathematics | 1997-11-25 | Paper |
Vertex heaviest paths and cycles in quasi-transitive digraphs
Discrete Mathematics | 1997-11-25 | Paper |
Paths and cycles in extended and decomposable digraphs
Discrete Mathematics | 1997-10-07 | Paper |
A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
Discrete Mathematics | 1997-09-17 | Paper |
Ranking the vertices of a complete multipartite paired comparison digraph
Discrete Applied Mathematics | 1997-08-17 | Paper |
Finding a Longest Path in a Complete Multipartite Digraph
SIAM Journal on Discrete Mathematics | 1997-06-29 | Paper |
On \(k\)-strong and \(k\)-cyclic digraphs
Discrete Mathematics | 1997-06-10 | Paper |
scientific article; zbMATH DE number 969179 (Why is no real title available?)
| 1997-06-10 | Paper |
A classification of locally semicomplete digraphs
Discrete Mathematics | 1997-06-09 | Paper |
scientific article; zbMATH DE number 908788 (Why is no real title available?)
| 1996-11-05 | Paper |
Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
Journal of Graph Theory | 1996-06-18 | Paper |
Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs
Discrete Mathematics | 1996-06-18 | Paper |
Weakly Hamiltonian-connected ordinary multipartite tournaments
Discrete Mathematics | 1996-03-10 | Paper |
Minimizing and maximizing the diameter in orientations of graphs
Graphs and Combinatorics | 1995-05-28 | Paper |
scientific article; zbMATH DE number 731861 (Why is no real title available?)
| 1995-03-08 | Paper |
Maximizing traveling salesman problem for special matrices
Discrete Applied Mathematics | 1995-02-01 | Paper |
On cycles in multipartite tournaments
Journal of Combinatorial Theory. Series B | 1994-05-24 | Paper |
Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees
| N/A | Paper |
On the $k$-anti-traceability Conjecture
| N/A | Paper |
