Dimitris Magos

Discret. Math., 2020

2018

The stable b-matching polytope revisited.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

2017

Submodularity and its application to some global constraints.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2017

2016

Pareto Optimal Matchings in Many-to-Many Markets with Ties.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2016

On the completability of incomplete orthogonal Latin rectangles.

[BibT_eX]

[DOI]

Discret. Math., 2016

An Integrated Solver for Multi-index Assignment.

[BibT_eX]

[DOI]

Stathis Plitsos

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016

2014

Blockers and antiblockers of stable matchings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

From One Stable Marriage to the Next: How Long Is the Way?

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

Polyhedral Aspects of Stable Marriage.

[BibT_eX]

[DOI]

Math. Oper. Res., 2014

Pareto optimality in many-to-many matching problems.

[BibT_eX]

[DOI]

Discret. Optim., 2014

2013

The constraint of difference and total dual integrality.

[BibT_eX]

[DOI]

Proceedings of the 17th Panhellenic Conference on Informatics, 2013

2012

A polyhedral approach to the alldifferent system.

[BibT_eX]

[DOI]

Math. Program., 2012

Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2012

Test set embedding into low-power sequences based on a traveling salesman problem formulation.

[BibT_eX]

[DOI]

Proceedings of the 7th International Conference on Design & Technology of Integrated Systems in Nanoscale Era, 2012

2011

An Accumulator - Based Test-Per-Clock Scheme.

[BibT_eX]

[DOI]

Ioannis Voyiatzis

Steffen Tarnick

IEEE Trans. Very Large Scale Integr. Syst., 2011

On the Facial Structure of the Alldifferent System.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

2009

Clique facets of the axial and planar assignment polytopes.

[BibT_eX]

[DOI]

Discret. Optim., 2009

Persistency and matroid intersection.

[BibT_eX]

[DOI]

Leonidas S. Pitsoulis

Comput. Manag. Sci., 2009

2008

The wheels of the OLS polytope: Facets and separation.

[BibT_eX]

[DOI]

Discret. Math., 2008

A Low-Cost Accumulator-Based Test Pattern Generation Architecture.

[BibT_eX]

[DOI]

Ioannis Voyiatzis

Steffen Tarnick

Proceedings of the 14th IEEE International On-Line Testing Symposium (IOLTS 2008), 2008

2007

Hyperarc Consistency for the Stable Admissions Problem.

[BibT_eX]

[DOI]

Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), 2007

2006

The Matching Predicate and a Filtering Scheme Based on Matroids.

[BibT_eX]

[DOI]

Leonidas S. Pitsoulis

J. Comput., 2006

Searching for Mutually Orthogonal Latin Squares via integer and constraint programming.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2006

On the orthogonal Latin squares polytope.

[BibT_eX]

[DOI]

Jeannette C. M. Janssen

Discret. Math., 2006

A new class of facets for the Latin square polytope.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Consistency of the Matching Predicate.

[BibT_eX]

[DOI]

Leonidas S. Pitsoulis

Proceedings of the Advances in Artificial Intelligence, 4th Helenic Conference on AI, 2006

2005

The Wheels of the Orthogonal Latin Squares Polytope: Classification and Valid Inequalities.

[BibT_eX]

[DOI]

J. Comb. Optim., 2005

On the system of two <i>all_different</i> predicates.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

2004

An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

A Branch & Cut algorithm for a four-index assignment problem.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2004

LP Relaxations of Multiple all_different Predicates.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2004

2002

Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem.

[BibT_eX]

[DOI]