Anders Yeo

Discret. Math., 2025

2024

Transversals in regular uniform hypergraphs.

[BibT_eX]

[DOI]

J. Graph Theory, March, 2024

On Seymour's and Sullivan's second neighbourhood conjectures.

[BibT_eX]

[DOI]

J. Graph Theory, March, 2024

Bounds on Maximum Weight Directed Cut.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2024

Finding all stable matchings with assignment constraints.

[BibT_eX]

[DOI]

Games Econ. Behav., 2024

Note on disjoint cycles in multipartite tournaments.

[BibT_eX]

[DOI]

Discret. Math., 2024

Safe sets and in-dominating sets in digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

Upper bounds on minimum size of feedback arc set of directed multigraphs with bounded degree.

[BibT_eX]

[DOI]

CoRR, 2024

Speeding up deferred acceptance.

[BibT_eX]

[DOI]

CoRR, 2024

Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials.

[BibT_eX]

[DOI]

CoRR, 2024

Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees.

[BibT_eX]

[DOI]

CoRR, 2024

2023

(1,1)-Cluster Editing is polynomial-time solvable.

[BibT_eX]

[DOI]

Discret. Appl. Math., December, 2023

Unique stable matchings.

[BibT_eX]

[DOI]

Games Econ. Behav., September, 2023

Results on the small quasi-kernel conjecture.

[BibT_eX]

[DOI]

Discret. Math., July, 2023

The Tuza-Vestergaard Theorem.

[BibT_eX]

[DOI]

Christian Löwenstein

SIAM J. Discret. Math., June, 2023

Lower Bounds for Maximum Weighted Cut.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., June, 2023

Exact capacitated domination: On the computational complexity of uniqueness.

[BibT_eX]

[DOI]

Discret. Appl. Math., June, 2023

Making a tournament k $k$-strong.

[BibT_eX]

[DOI]

Kasper Skov Johansen

J. Graph Theory, May, 2023

The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties.

[BibT_eX]

[DOI]

Theor. Comput. Sci., March, 2023

Preference swaps for the stable matching problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

Directed Steiner tree packing and directed tree connectivity.

[BibT_eX]

[DOI]

Yuefang Sun

J. Graph Theory, 2023

Spanning eulerian subdigraphs in semicomplete digraphs.

[BibT_eX]

[DOI]

Frédéric Havet

J. Graph Theory, 2023

k-best feature selection and ranking via stochastic approximation.

[BibT_eX]

[DOI]

David V. Akman

Milad Malekipirbazari

Expert Syst. Appl., 2023

Some coordination problems are harder than others.

[BibT_eX]

[DOI]

CoRR, 2023

Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem.

[BibT_eX]

[DOI]

CoRR, 2023

Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems.

[BibT_eX]

[DOI]

CoRR, 2023

Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022

A complete description of convex sets associated with matchings and edge-connectivity in graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Perfect forests in graphs and their extensions.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Arc-disjoint in- and out-branchings in digraphs of independence number at most 2.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Non-separating Spanning Trees and Out-Branchings in Digraphs of Independence Number 2.

[BibT_eX]

[DOI]

Stéphane Bessy

Graphs Comb., 2022

(1, 1)-Cluster Editing is Polynomial-time Solvable.

[BibT_eX]

[DOI]

CoRR, 2022

Component Order Connectivity in Directed Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2022

2021

Proper-walk connection number of graphs.

[BibT_eX]

[DOI]

Thomas Bellitto

J. Graph Theory, 2021

Affine Planes and Transversals in 3-Uniform Linear Hypergraphs.

[BibT_eX]

[DOI]

Graphs Comb., 2021

On Supereulerian 2-Edge-Coloured Graphs.

[BibT_eX]

[DOI]

Thomas Bellitto

Graphs Comb., 2021

Dominating vertex covers: the vertex-edge domination problem.

[BibT_eX]

[DOI]

William F. Klostermeyer

Margaret-Ellen Messinger

Discuss. Math. Graph Theory, 2021

Matching and edge-connectivity in graphs with given maximum degree.

[BibT_eX]

[DOI]

Discret. Math., 2021

Lower bounds on Tuza constants for transversals in linear uniform hypergraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

A new upper bound on the total domination number in graphs with minimum degree six.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

2020

The directed 2-linkage problem with length constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

On the parameterized complexity of 2-partitions.

[BibT_eX]

[DOI]

Jonas Bamse Andersen

Theor. Comput. Sci., 2020

Arc-disjoint strong spanning subdigraphs of semicomplete compositions.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Bounds on upper transversals in hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments.

[BibT_eX]

[DOI]

Hugues Déprés

Discret. Math., 2020

Non-separating spanning trees and out-branchings in digraphsof independence number 2.

[BibT_eX]

[DOI]

Stéphane Bessy

CoRR, 2020

Uniqueness of DP-Nash Subgraphs and D-sets in Weighted Graphs of Netflix Games.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

Strong subgraph k-connectivity.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

Bipartite spanning sub(di)graphs induced by 2-partitions.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

Upper transversals in hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

Safe sets in digraphs.

[BibT_eX]

[DOI]

CoRR, 2019

Connecting edge-colouring.

[BibT_eX]

[DOI]

Thomas Bellitto

CoRR, 2019

2018

Out-degree reducing partitions of digraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Tight lower bounds on the matching number in a graph with given maximum degree.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2018

On Upper Transversals in 3-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

Semicomplete Multipartite Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Classes of Directed Graphs., 2018

2017

Note on Perfect Forests in Digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Rural postman parameterized by the number of components of required edges.

[BibT_eX]

[DOI]

Magnus Wahlström

J. Comput. Syst. Sci., 2017

A note on fractional disjoint transversals in hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2017

Acyclicity in edge-colored graphs.

[BibT_eX]

[DOI]

Discret. Math., 2017

Chinese Postman Problem on edge-colored multigraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Transversals and Independence in Linear Hypergraphs with Maximum Degree Two.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

Graphical coprime walk algorithm for structural controllability of discrete-time rank-one bilinear systems.

[BibT_eX]

[DOI]

Supratim Ghosh

Justin Ruths

Autom., 2017

Parameterized Constraint Satisfaction Problems: a Survey.

[BibT_eX]

[DOI]

Proceedings of the Constraint Satisfaction Problem: Complexity and Approximability, 2017

2016

Kernelization, MaxLin Above Average.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

Independence in 5-uniform hypergraphs.

[BibT_eX]

[DOI]

Alex Eustis

Discret. Math., 2016

The complexity of finding arc-disjoint branching flows.

[BibT_eX]

[DOI]

Frédéric Havet

Discret. Appl. Math., 2016

Transversals in 4-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

Parameterizations of Test Cover with Bounded Test Sizes.

[BibT_eX]

[DOI]

Algorithmica, 2016

2015

Balanced branchings in digraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Total Transversals in Hypergraphs and Their Applications.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

On 2-Colorings of Hypergraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2015

Progress on the Murty-Simon Conjecture on diameter-2 critical graphs: a survey.

[BibT_eX]

[DOI]

Lucas C. van der Merwe

J. Comb. Optim., 2015

2014

The complexity of multicut and mixed multicut problems in (di)graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Total Domination in Graphs with Diameter 2.

[BibT_eX]

[DOI]

J. Graph Theory, 2014

Satisfying more than half of a system of linear equations over GF(2): A multivariate approach.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2014

Distinguishing-Transversal in Hypergraphs and Identifying Open Codes in Cubic Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2014

On the Meyniel condition for hamiltonicity in bipartite digraphs.

[BibT_eX]

[DOI]

Janusz Adamus

Lech Adamus

Discret. Math. Theor. Comput. Sci., 2014

Relating the annihilation number and the 2-domination number of a tree.

[BibT_eX]

[DOI]

Discret. Math., 2014

A new lower bound for the total domination number in graphs proving a Graffiti.pc Conjecture.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

A New Lower Bound on the Independence Number of a Graph and Applications.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

Total Transversals and Total Domination in Uniform Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables.

[BibT_eX]

[DOI]

Algorithmica, 2014

2013

On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem.

[BibT_eX]

[DOI]

Jason Crampton

ACM Trans. Inf. Syst. Secur., 2013

Parameterized complexity of k-Chinese Postman Problem.

[BibT_eX]

[DOI]

Gabriele Muciaccia

Theor. Comput. Sci., 2013

Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties.

[BibT_eX]

[DOI]

Daniel Gonçalves

Theor. Comput. Sci., 2013

Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed Value.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_{2}$.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

(Non-)existence of polynomial kernels for the Test Cover problem.

[BibT_eX]

[DOI]

Gabriele Muciaccia

Inf. Process. Lett., 2013

A new bound for 3-satisfiable MaxSat and its algorithmic application.

[BibT_eX]

[DOI]

Inf. Comput., 2013

22-colorings in kk-regular kk-uniform hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

Transversals and matchings in 3-uniform hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

Hypergraphs with large transversal number.

[BibT_eX]

[DOI]

Discret. Math., 2013

Total domination and matching numbers in graphs with all vertices in triangles.

[BibT_eX]

[DOI]

Discret. Math., 2013

Parameterized Rural Postman and Conjoining Bipartite Matching Problems.

[BibT_eX]

[DOI]

Magnus Wahlström

CoRR, 2013

2012

Arc-disjoint spanning sub(di)graphs in digraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Vertex Disjoint Cycles of Different Length in Digraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

An algorithm for finding input-output constrained convex sets in an acyclic digraph.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

Parameterized Eulerian strong component arc deletion problem on tournaments.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Girth and Total Domination in Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2012

On a conjecture of Murty and Simon on diameter two critical graphs II.

[BibT_eX]

[DOI]

Discret. Math., 2012

Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Identifying Vertex Covers in Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming.

[BibT_eX]

[DOI]

Eun Jung Kim

Arezou Soleimanfallah

Stefan Szeider

Algorithmica, 2012

A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications.

[BibT_eX]

[DOI]

Algorithmica, 2012

Parameterized Study of the Test Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

On the parameterized complexity of the workflow satisfiability problem.

[BibT_eX]

[DOI]

Jason Crampton

Proceedings of the ACM Conference on Computer and Communications Security, 2012

Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey.

[BibT_eX]

[DOI]

Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

2011

Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems.

[BibT_eX]

[DOI]

Mark Jones

Theor. Comput. Sci., 2011

Kernel bounds for disjoint cycles and disjoint paths.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Theor. Comput. Sci., 2011

A probabilistic approach to problems parameterized above or below tight bounds.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2011

Perfect Matchings in Total Domination Critical Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2011

A kernel of order 2k-c for Vertex Cover.

[BibT_eX]

[DOI]

Arezou Soleimanfallah

Discret. Math., 2011

On a conjecture of Murty and Simon on diameter 2-critical graphs.

[BibT_eX]

[DOI]

Lucas C. van der Merwe

Discret. Math., 2011

On the existence of k-partite or Kp-free total domination edge-critical graphs.

[BibT_eX]

[DOI]

Lucas C. van der Merwe

Discret. Math., 2011

A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free.

[BibT_eX]

[DOI]

Discret. Optim., 2011

Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_2$

[BibT_eX]

[DOI]

CoRR, 2011

Lower Bound for Max-$r$-Lin2 and its Applications in Algorithmics and Graph Theory

[BibT_eX]

[DOI]

CoRR, 2011

A New Bound on the Domination Number of Graphs with Minimum Degree Two.

[BibT_eX]

[DOI]

Ingo Schiermeyer

Electron. J. Comb., 2011

Solving MAX-r-SAT Above a Tight Lower Bound.

[BibT_eX]

[DOI]

Algorithmica, 2011

Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application.

[BibT_eX]

[DOI]

Mark Jones

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

2010

Strong Transversals in Hypergraphs and Double Total Domination in Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Betweenness parameterized above tight lower bound.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2010

FPT algorithms and kernels for the Directed k-Leaf problem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2010

Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2010

Note on maximal bisection above tight lower bound.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels

[BibT_eX]

[DOI]

CoRR, 2010

Linear-Number-of-Variables Kernel for Unit-Conflict-Free-Max-Sat Parameterized Above Expectation

[BibT_eX]

[DOI]

CoRR, 2010

Solving MAX-r-SAT Above a Tight Lower Bound.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

2009

Total domination in 2-connected graphs and in graphs with no induced 6-cycles.

[BibT_eX]

[DOI]

J. Graph Theory, 2009

Algorithms for generating convex sets in acyclic digraphs.

[BibT_eX]

[DOI]

Arezou Soleimanfallah

J. Discrete Algorithms, 2009

Minimum Cost Homomorphism Dichotomy for Oriented Cycles.

[BibT_eX]

[DOI]

Graphs Comb., 2009

Total Domination in Partitioned Graphs.

[BibT_eX]

[DOI]

Allan Frendrup

Preben D. Vestergaard

Graphs Comb., 2009

Some complexity problems on single input double output controllers.

[BibT_eX]

[DOI]

Katalin M. Hangos

Zsolt Tuza

Discret. Appl. Math., 2009

On the number of connected convex subgraphs of a connected acyclic digraph.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Ordinal Embedding Relaxations Parameterized Above Tight Lower Bound

[BibT_eX]

[DOI]

CoRR, 2009

Solving MAX-2-SAT Above a Tight Lower Bound

[BibT_eX]

[DOI]

CoRR, 2009

A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound

[BibT_eX]

[DOI]

CoRR, 2009

A Polynomial Kernel for Multicut in Trees.

[BibT_eX]

[DOI]

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Better Than Optimal: Fast Identification of Custom Instruction Candidates.

[BibT_eX]

[DOI]

Proceedings of the 12th IEEE International Conference on Computational Science and Engineering, 2009

Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008

Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Hypergraphs with large transversal number and with edge sizes at least 3.

[BibT_eX]

[DOI]

J. Graph Theory, 2008

Total Domination in Graphs with Given Girth.

[BibT_eX]

[DOI]

Graphs Comb., 2008

A dichotomy for minimum cost graph homomorphisms.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

On matching and total domination in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

Hoàng-Reed conjecture holds for tournaments.

[BibT_eX]

[DOI]

Frédéric Havet

Discret. Math., 2008

Minimum cost homomorphisms to semicomplete multipartite digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

The minimum spanning strong subdigraph problem is fixed parameter tractable.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Some Parameterized Problems On Digraphs.

[BibT_eX]

[DOI]

Comput. J., 2008

Fixed-Parameter Complexity of Minimum Profile Problems.

[BibT_eX]

[DOI]

Stefan Szeider

Algorithmica, 2008

2007

The Linear Arrangement Problem Parameterized Above Guaranteed Value.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2007

Relationships between total domination, order, size, and maximum degree of graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

Paths and cycles containing given arcs, in close to regular multipartite tournaments.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph.

[BibT_eX]

[DOI]

Graphs Comb., 2007

The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments.

[BibT_eX]

[DOI]

Pierre Charbit

Comb. Probab. Comput., 2007

A New Upper Bound on the Total Domination Number of a Graph.

[BibT_eX]

[DOI]

Electron. J. Comb., 2007

Total domination of graphs and small transversals of hypergraphs.

[BibT_eX]

[DOI]

Comb., 2007

The Greedy Algorithm for the Symmetric TSP.

[BibT_eX]

[DOI]

Algorithmic Oper. Res., 2007

2006

On n-partite Tournaments with Unique n-cycle.

[BibT_eX]

[DOI]

Graphs Comb., 2006

Hamilton cycles in digraphs of unitary matrices.

[BibT_eX]

[DOI]

Discret. Math., 2006

Longest path partitions in generalizations of tournaments.

[BibT_eX]

[DOI]

Morten Hegner Nielsen

Discret. Math., 2006

Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs.

[BibT_eX]

[DOI]

Discret. Optim., 2006

Level of repair analysis and minimum cost homomorphisms of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Minimum cost and list homomorphisms to semicomplete digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Domination analysis for minimum multiprocessor scheduling.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs

[BibT_eX]

[DOI]

CoRR, 2006

Total Domination and Matching Numbers in Claw-Free Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

Note on Upper Bounds for TSP Domination Number.

[BibT_eX]

[DOI]

Angela Koller

Algorithmic Oper. Res., 2006

On-line bin Packing with Two Item Sizes.

[BibT_eX]

[DOI]

Algorithmic Oper. Res., 2006

2005

The number of pancyclic arcs in a k-strong tournament.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

Kernels in planar digraphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2005

A problem of finding an acceptable variant in generalized project networks.

[BibT_eX]

[DOI]

David Blokh

Adv. Decis. Sci., 2005

Batched bin packing.

[BibT_eX]

[DOI]

Discret. Optim., 2005

Mediated digraphs and quantum nonlocality.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Optimal On-Line Bin Packing with Two Item Sizes.

[BibT_eX]

Proceedings of the Algorithms and Complexity in Durham 2005, 2005

2004

On the number of quasi-kernels in digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2004

Spanning k-arc-strong subdigraphs with few arcs in k-arc-strong tournaments.

[BibT_eX]

[DOI]

J. Graph Theory, 2004

Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments.

[BibT_eX]

[DOI]

Lutz Volkmann

Discret. Math., 2004

When the greedy algorithm fails.

[BibT_eX]

[DOI]

Discret. Optim., 2004

Making a tournament k-arc-strong by reversing or deorienting arcs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Decomposing k-arc-Strong Tournaments Into Strong Spanning Subdigraphs.

[BibT_eX]

[DOI]

Comb., 2004

2003

Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2003

Transformations of generalized ATSP into ATSP.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2003

Packing paths in digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2003

Small degree out-branchings.

[BibT_eX]

[DOI]

J. Graph Theory, 2003

Steiner type problems for digraphs that are locally semicomplete or extended semicomplete.

[BibT_eX]

[DOI]

J. Graph Theory, 2003

Upper bounds on ATSP neighborhood size.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Domination analysis of combinatorial optimization problems.

[BibT_eX]

[DOI]

Alek Vainshtein

Discret. Appl. Math., 2003

Assignment problem based algorithms are impractical for the generalized TSP.

[BibT_eX]

[DOI]

Australas. J Comb., 2003

2002

Anti-matroids.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2002

Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs.

[BibT_eX]

[DOI]

Graphs Comb., 2002

Almost all almost regular c-partite tournaments with cgeq5 are vertex pancyclic.

[BibT_eX]

[DOI]

Meike Tewes

Lutz Volkmann

Discret. Math., 2002

Pushing vertices in digraphs without long induced cycles.

[BibT_eX]

[DOI]

Gary MacGillivray

Discret. Appl. Math., 2002

Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP.

[BibT_eX]

[DOI]

Alexey Zverovich

Discret. Appl. Math., 2002

Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

Orientations of digraphs almost preserving diameter.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

2001

TSP tour domination and Hamilton cycle decompositions of regular digraphs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2001

The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs.

[BibT_eX]

[DOI]

J. Algorithms, 2001

Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs.

[BibT_eX]

[DOI]

Graphs Comb., 2001

Construction heuristics for the asymmetric TSP.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2001

Making a tournament k-arc-strong by reversing arcs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Remarks on hamiltonian digraphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2001

2000

Convex-Round and Concave-Round Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2000

Kings in semicomplete multipartite digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

Quasi-Hamiltonicity: A Series of Necessary Conditions for a Digraph to Be Hamiltonian.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2000

Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs.

[BibT_eX]

[DOI]

Meike Tewes

Discret. Math., 2000

Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian.

[BibT_eX]

[DOI]

Discret. Math., 2000

Complementary cycles containing prescribed vertices in tournaments.

[BibT_eX]

[DOI]

Yubao Guo

Discret. Math., 2000

1999

Diregular c-partite tournaments are vertex-pancyclic when c ≥ 5.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

Hamilton cycles, avoiding prescribed arcs, in close-to-regular tournaments.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph.

[BibT_eX]

[DOI]

J. Algorithms, 1999

How Close to Regular Must a Semicomplete Multipartite Digraph Be to Secure Hamiltonicity?

[BibT_eX]

[DOI]

Graphs Comb., 1999

A New Sufficient Condition for a Digraph to Be Hamiltonian.

[BibT_eX]

[DOI]

Yubao Guo

Discret. Appl. Math., 1999

Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour.

[BibT_eX]

[DOI]

Comput. Oper. Res., 1999

Construction Heuristics and Domination Analysis for the Asymmetric TSP.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering, 1999

1998

A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1998

Maximal and Minimal Vertex-Critical Graphs of Diameter Two.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1998

Note on alternating directed cycles.

[BibT_eX]

[DOI]

Benny Sudakov

Discret. Math., 1998

Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

1997

One-diregular subgraphs in semicomplete multipartite digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1997

A Note on Alternating Cycles in Edge-Coloured Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1997

Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1997

1996

On k-strong and k-cyclic digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1996

Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph.

[BibT_eX]

[DOI]