The following pages link to Pavlos Eirinakis (Q261360):
Displaying 18 items.
- Fast algorithms for the undirected negative cost cycle detection problem (Q261362) (← links)
- On the complexity of quantified linear systems (Q391791) (← links)
- A complexity perspective on entailment of parameterized linear constraints (Q487646) (← links)
- Pareto optimal matchings in many-to-many markets with ties (Q506537) (← links)
- Analyzing restricted fragments of the theory of linear arithmetic (Q513354) (← links)
- The stable \(b\)-matching polytope revisited (Q1801060) (← links)
- On quantified linear implications (Q2254606) (← links)
- The diameter of the stable marriage polytope: bounding from below (Q2305917) (← links)
- Pareto optimality in many-to-many matching problems (Q2339842) (← links)
- Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic'' (Q2364369) (← links)
- Blockers and antiblockers of stable matchings (Q2637344) (← links)
- Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem (Q2815443) (← links)
- Finding a minimum-regret many-to-many Stable Matching (Q2868914) (← links)
- On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem (Q2971390) (← links)
- Pareto Optimal Matchings in Many-to-Many Markets with Ties (Q3449579) (← links)
- Polyhedral Aspects of Stable Marriage (Q5244861) (← links)
- From One Stable Marriage to the Next: How Long Is the Way? (Q5246098) (← links)
- (Q5740949) (← links)
