| Publication | Date of Publication | Type |
|---|
| Greedy heuristic guided by lexicographic excellence | 2024-11-12 | Paper |
Filling crosswords is very hard
Theoretical Computer Science | 2024-02-23 | Paper |
scientific article; zbMATH DE number 7788609 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet * | 2023-07-24 | Paper |
Project games
Theoretical Computer Science | 2023-04-20 | Paper |
| On fairness via picking sequences in allocation of indivisible goods | 2023-03-31 | Paper |
| scientific article; zbMATH DE number 7561427 (Why is no real title available?) | 2022-07-21 | Paper |
In memory of Jérôme Monnot
Theoretical Computer Science | 2022-05-23 | Paper |
| Object allocation and positive graph externalities | 2021-07-06 | Paper |
Project games
Lecture Notes in Computer Science | 2020-02-06 | Paper |
| On a simple hedonic game with graph-restricted communication | 2020-02-04 | Paper |
Agreeable sets with matroidal constraints
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
Subset sum problems with digraph constraints
Journal of Combinatorial Optimization | 2018-12-06 | Paper |
On maximin share allocations in matroids
Theoretical Computer Science | 2018-12-04 | Paper |
| Strategic voting in a social context: considerate equilibria | 2018-07-12 | Paper |
Approximate maximin share allocations in matroids
Lecture Notes in Computer Science | 2017-07-21 | Paper |
| Near fairness in matroids | 2017-07-18 | Paper |
The price of optimum: complexity and approximation for a matching game
Algorithmica | 2017-04-12 | Paper |
Selfish transportation games
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
Bi-objective matchings with the triangle inequality
Theoretical Computer Science | 2017-03-16 | Paper |
Conference program design with single-peaked and single-crossing preferences
Web and Internet Economics | 2017-02-10 | Paper |
Strategic scheduling games: equilibria and efficiency
Just-in-Time Systems | 2017-02-03 | Paper |
Congestion games with capacitated resources
Theory of Computing Systems | 2016-01-13 | Paper |
| Approximate tradeoffs on matroids | 2015-12-11 | Paper |
Profitable Deviation Strong Equilibria
Algorithmic Decision Theory | 2015-11-04 | Paper |
The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles
Theoretical Computer Science | 2015-09-25 | Paper |
Approximating the optimal sequence of acquisitions and sales with a capped budget
Information Processing Letters | 2015-06-15 | Paper |
Worst case compromises in matroids with applications to the allocation of indivisible goods
Theoretical Computer Science | 2015-06-01 | Paper |
Approximate tradeoffs on weighted labeled matroids
Discrete Applied Mathematics | 2015-04-28 | Paper |
A protocol for cutting matroids like cakes
Web and Internet Economics | 2015-01-12 | Paper |
The Lazy Matroid Problem
Advanced Information Systems Engineering | 2014-09-15 | Paper |
Approximation with a fixed number of solutions of some multiobjective maximization problems
Journal of Discrete Algorithms | 2014-08-13 | Paper |
| On paths, trails and closed trails in edge-colored graphs | 2014-03-25 | Paper |
Possible winners in approval voting
Algorithmic Decision Theory | 2013-12-17 | Paper |
Cooperation in multiorganization matching
Algorithmic Operations Research | 2013-12-11 | Paper |
Designing budget-balanced best-response mechanisms for network coordination games
Algorithmic Game Theory | 2013-10-23 | Paper |
The lazy bureaucrat problem with common arrivals and deadlines: approximation and mechanism design
Fundamentals of Computation Theory | 2013-08-16 | Paper |
On \(s\)--\(t\) paths and trails in edge-colored graphs
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Single approximation for the biobjective Max TSP
Theoretical Computer Science | 2013-06-06 | Paper |
Labeled traveling salesman problems: complexity and approximation
Discrete Optimization | 2013-05-31 | Paper |
Complexity of trails, paths and circuits in arc-colored digraphs
Discrete Applied Mathematics | 2013-04-18 | Paper |
Congestion games with capacitated resources
Algorithmic Game Theory | 2013-03-13 | Paper |
Strategic Coloring of a Graph
Internet Mathematics | 2013-02-15 | Paper |
Single approximation for biobjective max TSP
Approximation and Online Algorithms | 2012-07-16 | Paper |
Approximation with a fixed number of solutions of some biobjective maximization problems
Approximation and Online Algorithms | 2012-07-16 | Paper |
| Combinatorial optimization problems arising from interactive congestion situations | 2012-01-26 | Paper |
Strategy-proof mechanisms for facility location games with many facilities
Algorithmic Decision Theory | 2011-10-28 | Paper |
The price of optimum in a matching game
Algorithmic Game Theory | 2011-10-28 | Paper |
| scientific article; zbMATH DE number 5823944 (Why is no real title available?) | 2010-12-08 | Paper |
The minimum reload \(s-t\) path, trail and walk problems
Discrete Applied Mathematics | 2010-08-13 | Paper |
Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs
Lecture Notes in Computer Science | 2010-06-17 | Paper |
On the impact of local taxes in a set cover game
Structural Information and Communication Complexity | 2010-06-17 | Paper |
The max \(k\)-cut game and its strong equilibria
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Strategic coloring of a graph
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation
European Journal of Operational Research | 2010-03-18 | Paper |
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
Journal of Discrete Algorithms | 2010-02-26 | Paper |
Fair cost-sharing methods for the minimum spanning tree game
Information Processing Letters | 2010-01-29 | Paper |
On a Labeled Vehicle Routing Problem
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
Approximation results for a bicriteria job scheduling problem on a single machine without preemption
Information Processing Letters | 2009-12-04 | Paper |
On the minimum hitting set of bundles problem
Theoretical Computer Science | 2009-11-04 | Paper |
Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Cooperation in Multiorganization Matching
Approximation and Online Algorithms | 2009-02-12 | Paper |
The Minimum Reload s-t Path/Trail/Walk Problems
Lecture Notes in Computer Science | 2009-02-03 | Paper |
On Labeled Traveling Salesman Problems
Algorithms and Computation | 2009-01-29 | Paper |
On the Minimum Hitting Set of Bundles Problem
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Complexity and Approximation Results for the Connected Vertex Cover Problem
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Approximation algorithms for the bi-criteria weighted MAX-CUT problem
Discrete Applied Mathematics | 2006-08-14 | Paper |
Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
Theoretical Computer Science | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 2102230 (Why is no real title available?) | 2004-09-22 | Paper |
