default search action
Dimitris Magos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j24]Pavlos Eirinakis, Dimitrios Magos, Ioannis Mourtos
:
The diameter of the stable marriage polytope: Bounding from below. Discret. Math. 343(5): 111804 (2020)
2010 – 2019
- 2018
- [j23]Pavlos Eirinakis
The stable b-matching polytope revisited. Discret. Appl. Math. 250: 186-201 (2018) - 2017
- [j22]Dimitris Magos, Ioannis Mourtos
Submodularity and its application to some global constraints. Ann. Math. Artif. Intell. 79(4): 267-289 (2017) - 2016
- [j21]Gautam Appa, Reinhardt Euler, Anastasia Kouvela, Dimitris Magos, Ioannis Mourtos
On the completability of incomplete orthogonal Latin rectangles. Discret. Math. 339(6): 1771-1794 (2016) - [j20]Katarína Cechlárová
Pareto Optimal Matchings in Many-to-Many Markets with Ties. Theory Comput. Syst. 59(4): 700-721 (2016) - [c9]Stathis Plitsos, Dimitrios Magos, Ioannis Mourtos:
An Integrated Solver for Multi-index Assignment. ISAIM 2016 - 2015
- [c8]Katarína Cechlárová
Pareto Optimal Matchings in Many-to-Many Markets with Ties. SAGT 2015: 27-39 - [i1]Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, David F. Manlove, Ioannis Mourtos, Eva Oceláková, Baharak Rastegari:
Pareto Optimal Matchings in Many-to-Many Markets with Ties. CoRR abs/1507.02866 (2015) - 2014
- [j19]Katarína Cechlárová
Pareto optimality in many-to-many matching problems. Discret. Optim. 14: 160-169 (2014) - [j18]Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos
Polyhedral Aspects of Stable Marriage. Math. Oper. Res. 39(3): 656-671 (2014) - [j17]Pavlos Eirinakis, Dimitrios Magos, Ioannis Mourtos
From One Stable Marriage to the Next: How Long Is the Way? SIAM J. Discret. Math. 28(4): 1971-1979 (2014) - [j16]Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos
Blockers and antiblockers of stable matchings. Theor. Comput. Sci. 524: 126-133 (2014) - 2013
- [c7]Dimitris Magos:
The constraint of difference and total dual integrality. Panhellenic Conference on Informatics 2013: 188-194 - 2012
- [j15]Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos
Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem. INFORMS J. Comput. 24(2): 245-259 (2012) - [j14]Dimitris Magos, Ioannis Mourtos
A polyhedral approach to the alldifferent system. Math. Program. 132(1-2): 209-260 (2012) - [c6]Ioannis Voyiatzis, Costas Efstathiou, Dimitris Magos, Cleo Sgouropoulou
Test set embedding into low-power sequences based on a traveling salesman problem formulation. DTIS 2012: 1-6 - 2011
- [j13]Dimitris Magos, Ioannis Mourtos
On the Facial Structure of the Alldifferent System. SIAM J. Discret. Math. 25(1): 130-158 (2011) - [j12]Dimitris Magos, Ioannis Voyiatzis, Steffen Tarnick:
An Accumulator - Based Test-Per-Clock Scheme. IEEE Trans. Very Large Scale Integr. Syst. 19(6): 1090-1094 (2011)
2000 – 2009
- 2009
- [j11]Dimitris Magos, Ioannis Mourtos
Persistency and matroid intersection. Comput. Manag. Sci. 6(4): 435-445 (2009) - [j10]Dimitris Magos, Ioannis Mourtos
Clique facets of the axial and planar assignment polytopes. Discret. Optim. 6(4): 394-413 (2009) - 2008
- [j9]Dimitris Magos, Ioannis Mourtos
The wheels of the OLS polytope: Facets and separation. Discret. Math. 308(16): 3634-3651 (2008) - [c5]Dimitris Magos, Ioannis Voyiatzis, Steffen Tarnick:
A Low-Cost Accumulator-Based Test Pattern Generation Architecture. IOLTS 2008: 267-272 - 2007
- [c4]Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos
Hyperarc Consistency for the Stable Admissions Problem. ICTAI (1) 2007: 239-242 - 2006
- [j8]Gautam Appa, Dimitris Magos, Ioannis Mourtos
A new class of facets for the Latin square polytope. Discret. Appl. Math. 154(6): 900-911 (2006) - [j7]Gautam Appa, Dimitris Magos, Ioannis Mourtos
On the orthogonal Latin squares polytope. Discret. Math. 306(2): 171-187 (2006) - [j6]Gautam Appa, Dimitris Magos, Ioannis Mourtos
Searching for Mutually Orthogonal Latin Squares via integer and constraint programming. Eur. J. Oper. Res. 173(2): 519-530 (2006) - [j5]Dimitris Magos, Ioannis Mourtos
The Matching Predicate and a Filtering Scheme Based on Matroids. J. Comput. 1(6): 37-42 (2006) - [c3]Dimitris Magos, Ioannis Mourtos
Consistency of the Matching Predicate. SETN 2006: 555-558 - 2005
- [j4]Gautam Appa, Dimitris Magos, Ioannis Mourtos
On the system of two all_different predicates. Inf. Process. Lett. 94(3): 99-105 (2005) - [j3]Gautam Appa, Dimitris Magos, Ioannis Mourtos
The Wheels of the Orthogonal Latin Squares Polytope: Classification and Valid Inequalities. J. Comb. Optim. 10(4): 365-389 (2005) - 2004
- [j2]Gautam Appa, Dimitrios Magos, Ioannis Mourtos
A Branch & Cut algorithm for a four-index assignment problem. J. Oper. Res. Soc. 55(3): 298-307 (2004) - [j1]Gautam Appa, Dimitris Magos, Ioannis Mourtos
An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6. Oper. Res. Lett. 32(4): 336-344 (2004) - [c2]Gautam Appa, Dimitris Magos, Ioannis Mourtos
LP Relaxations of Multiple all_different Predicates. CPAIOR 2004: 364-369 - 2002
- [c1]Gautam Appa, Ioannis Mourtos
Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem. CP 2002: 17-32
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: