Dimitris Magos

发表

The Matching Predicate and a Filtering Scheme Based on Matroids

Leonidas S. Pitsoulis, Dimitris Magos, Ioannis Mourtos, 2006, J. Comput..

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

David Manlove, Katarína Cechlárová, Tamás Fleiner, 2015, Theory of Computing Systems.

Hyperarc Consistency for the Stable Admissions Problem

Dimitris Magos, Ioannis Mourtos, Pavlos Eirinakis, 2007, 19th IEEE International Conference on Tools with Artificial Intelligence(ICTAI 2007).

Blockers and antiblockers of stable matchings

Dimitris Magos, Ioannis Mourtos, Pavlos Eirinakis, 2014, Theor. Comput. Sci..

A polyhedral approach to the alldifferent system

Dimitris Magos, Ioannis Mourtos, Gautam Appa, 2012, Math. Program..

Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem

Dimitris Magos, Ioannis Mourtos, Gautam Appa, 2002, CP.

A new class of facets for the Latin square polytope

Dimitris Magos, Ioannis Mourtos, Gautam Appa, 2006, Discret. Appl. Math..

Searching for Mutually Orthogonal Latin Squares via integer and constraint programming

Dimitris Magos, Ioannis Mourtos, Gautam Appa, 2006, Eur. J. Oper. Res..

Submodularity and its application to some global constraints

Dimitris Magos, Ioannis Mourtos, 2016, Annals of Mathematics and Artificial Intelligence.

LP Relaxations of Multiple all_different Predicates

Dimitris Magos, Ioannis Mourtos, Gautam Appa, 2004, CPAIOR.

The stable b-matching polytope revisited

Dimitris Magos, Ioannis Mourtos, Pavlos Eirinakis, 2018, Discret. Appl. Math..

Pareto optimality in many-to-many matching problems

Katarína Cechlárová, Tamás Fleiner, Dimitris Magos, 2014, Discret. Optim..

On the completability of incomplete orthogonal Latin rectangles

Reinhardt Euler, Dimitris Magos, Ioannis Mourtos, 2016, Discret. Math..

The constraint of difference and total dual integrality

Dimitris Magos, D. Magos, 2013, PCI '13.

On the system of two all_different predicates

Dimitris Magos, Ioannis Mourtos, Gautam Appa, 2005, Inf. Process. Lett..

On the orthogonal Latin squares polytope

Dimitris Magos, Ioannis Mourtos, Jeannette C. M. Janssen, 2006, Discret. Math..

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

Dimitris Magos, Ioannis Mourtos, Gautam Appa, 2004, Oper. Res. Lett..

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

David Manlove, Katarína Cechlárová, Tamás Fleiner, 2015, SAGT.

Clique facets of the axial and planar assignment polytopes

Dimitris Magos, Ioannis Mourtos, D. Magos, 2009, Discret. Optim..

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

Dimitris Magos, Ioannis Mourtos, Gautam Appa, 2005, J. Comb. Optim..

On the Facial Structure of the Alldifferent System

Dimitris Magos, Ioannis Mourtos, 2011, SIAM J. Discret. Math..

Polyhedral Aspects of Stable Marriage

Dimitris Magos, Ioannis Mourtos, Pavlos Eirinakis, 2014, Math. Oper. Res..

Consistency of the Matching Predicate

Leonidas S. Pitsoulis, Dimitris Magos, Ioannis Mourtos, 2006, SETN.

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

Dimitris Magos, Ioannis Mourtos, Pavlos Eirinakis, 2014, SIAM J. Discret. Math..

An Integrated Solver for Multi-index Assignment

Dimitris Magos, Ioannis Mourtos, Stathis Plitsos, 2016, ISAIM.

Persistency and matroid intersection

Leonidas S. Pitsoulis, Dimitris Magos, Ioannis Mourtos, 2009, Comput. Manag. Sci..

An Accumulator—Based Test-Per-Clock Scheme

Ioannis Voyiatzis, Dimitris Magos, Steffen Tarnick, 2011, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

A Low-Cost Accumulator-Based Test Pattern Generation Architecture

Ioannis Voyiatzis, Dimitris Magos, Steffen Tarnick, 2008, 2008 14th IEEE International On-Line Testing Symposium.

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

Dimitris Magos, Ioannis Mourtos, Pavlos Eirinakis, 2012, INFORMS J. Comput..

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

Dimitris Magos, Ioannis Mourtos, Gautam Appa, 2004, J. Oper. Res. Soc..