Jérôme Monnot

Discret. Appl. Math., December, 2023

2022

Complexity and algorithms for constant diameter augmentation problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

On the complexity of solution extension of optimization problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

2021

Algorithmic aspects of upper edge domination.

[BibT_eX]

[DOI]

David F. Manlove

Theor. Comput. Sci., 2021

The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet.

[BibT_eX]

[DOI]

Proceedings of the 21st International Workshop on Algorithms in Bioinformatics, 2021

Abundant Extensions.

[BibT_eX]

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

Computing and testing Pareto optimal committees.

[BibT_eX]

[DOI]

Haris Aziz

Auton. Agents Multi Agent Syst., 2020

Strong Cliques in Diamond-Free Graphs.

[BibT_eX]

[DOI]

Nina Chiarelli

Berenice Martínez-Barona

Martin Milanic

Peter Mursic

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

On the Complexity of the Upper r-Tolerant Edge Cover Problem.

[BibT_eX]

[DOI]

Ararat Harutyunyan

Nikolaos Melissinos

Proceedings of the Topics in Theoretical Computer Science, 2020

2019

Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs.

[BibT_eX]

[DOI]

Dirk Oliver Theis

Theor. Comput. Sci., 2019

On maximin share allocations in matroids.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Efficient reallocation under additive and responsive preferences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Maximum Independent Sets in Subcubic Graphs: New Results.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Correction to: Weighted Upper Edge Cover: Complexity and Approximability.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Weighted Upper Edge Cover: Complexity and Approximability.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

On a Simple Hedonic Game with Graph-Restricted Communication.

[BibT_eX]

[DOI]

Vittorio Bilò

Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019

Extension and Its Price for the Connected Vertex Cover Problem.

[BibT_eX]

[DOI]

Nikolaos Melissinos

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Extension of Some Edge Graph Problems: Standard and Parameterized Complexity.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

Extension of Vertex Cover and Independent Set in Some Classes of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

Project Games.

[BibT_eX]

[DOI]

Vittorio Bilò

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018

The many facets of upper domination.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Subset sum problems with digraph constraints.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

Extension of vertex cover and independent set in some classes of graphs and generalizations.

[BibT_eX]

[DOI]

CoRR, 2018

Computing and Testing Pareto Optimal Committees.

[BibT_eX]

[DOI]

Haris Aziz

Jérôme Lang

CoRR, 2018

Upper Domination: Towards a Dichotomy Through Boundary Properties.

[BibT_eX]

[DOI]

Algorithmica, 2018

2017

Bi-objective matchings with the triangle inequality.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Weighted upper domination number.

[BibT_eX]

[DOI]

Arman Boyaci

Electron. Notes Discret. Math., 2017

The Price of Optimum: Complexity and Approximation for a Matching Game.

[BibT_eX]

[DOI]

Algorithmica, 2017

Selfish Transportation Games.

[BibT_eX]

[DOI]

Dimitris Fotakis

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Extended Spanning Star Forest Problems.

[BibT_eX]

[DOI]

Dirk Oliver Theis

Proceedings of the Combinatorial Optimization and Applications, 2017

Approximate Maximin Share Allocations in Matroids.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Beyond Electing and Ranking: Collective Dominating Chains, Dominating Subsets and Dichotomies.

[BibT_eX]

[DOI]

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016

Conference Program Design with Single-Peaked and Single-Crossing Preferences.

[BibT_eX]

[DOI]

Dimitris Fotakis

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Upper Domination: Complexity and Approximation.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

A Boundary Property for Upper Domination.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

How Hard Is It for a Party to Nominate an Election Winner?.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Achieving Proportional Representation in Conference Programs.

[BibT_eX]

[DOI]

Ioannis Caragiannis

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Computing Pareto Optimal Committees.

[BibT_eX]

[DOI]

Haris Aziz

Jérôme Lang

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Optimal Reallocation under Additive and Ordinal Preferences.

[BibT_eX]

[DOI]

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Algorithmic Aspects of Upper Domination: A Parameterised Perspective.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015

Worst case compromises in matroids with applications to the allocation of indivisible goods.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles.

[BibT_eX]

[DOI]

Luérbio Faria

Theor. Comput. Sci., 2015

New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2015

A note on the traveling salesman reoptimization problem under vertex insertion.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Approximate tradeoffs on weighted labeled matroids.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Algorithmic Aspects of Upper Domination.

[BibT_eX]

[DOI]

CoRR, 2015

2014

On the complexity of the selective graph coloring problem in some special classes of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

A note on the Clustered Set Covering Problem.

[BibT_eX]

[DOI]

Laurent Alfandari

Discret. Appl. Math., 2014

The Lazy Matroid Problem.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2014

Near Fairness in Matroids.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

A Dichotomy for Upper Domination in Monogenic Classes.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2014

On regular and approximately fair allocations of indivisible goods.

[BibT_eX]

[DOI]

Diodato Ferraioli

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013

Reoptimization of maximum weight induced hereditary subgraph problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Approximation with a fixed number of solutions of some multiobjective maximization problems.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2013

Reoptimization under Vertex Insertion: Max PK-Free Subgraph and Max Planar Subgraph.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2013

Complexity of trails, paths and circuits in arc-colored digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Resilience and optimization of identifiable bipartite graphs.

[BibT_eX]

[DOI]

Epameinondas Fritzilas

Martin Milanic

Yasmín Á. Ríos-Solís

Discret. Appl. Math., 2013

Fair solutions for some multiagent optimization problems.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2013

A Protocol for Cutting Matroids Like Cakes.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 9th International Conference, 2013

On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs.

[BibT_eX]

[DOI]

Vadim V. Lozin

Bernard Ries

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

A Matroid Approach to the Worst Case Allocation of Indivisible Goods.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

Truthful Many-to-Many Assignment with Private Weights.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

Possible Winners in Approval Voting.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013

2012

New candidates welcome! Possible winners with respect to the addition of new candidates.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2012

On paths, trails and closed trails in edge-colored graphs.

[BibT_eX]

[DOI]

Adria Ramos de Lyra

Discret. Math. Theor. Comput. Sci., 2012

Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

Cost allocation protocols for network formation on connection situations.

[BibT_eX]

[DOI]

Proceedings of the 6th International ICST Conference on Performance Evaluation Methodologies and Tools, 2012

Congestion Games with Capacitated Resources.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

Selective Graph Coloring in Some Special Classes of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

Approximate Tradeoffs on Matroids.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2012, 2012

Complexity Results for the Empire Problem in Collection of Stars.

[BibT_eX]

[DOI]

Basile Couëtoux

Sonia Toubaline

Proceedings of the Combinatorial Optimization and Applications, 2012

2011

Single Approximation for Biobjective Max TSP.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

Compilation and communication protocols for voting rules with a dynamic set of candidates.

[BibT_eX]

[DOI]

Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2011), 2011

The Price of Optimum in a Matching Game.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

Possible winners when new alternatives join: new results coming up!

[BibT_eX]

[DOI]

Lirong Xia

Jérôme Lang

Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

2010

Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2010

Approximation of the Clustered Set Covering Problem.

[BibT_eX]

[DOI]

Laurent Alfandari

Electron. Notes Discret. Math., 2010

Labeled Traveling Salesman Problems: Complexity and approximation.

[BibT_eX]

[DOI]

Discret. Optim., 2010

The minimum reload s-t path, trail and walk problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Minimum regulation of uncoordinated matchings

[BibT_eX]

[DOI]

CoRR, 2010

The Max k-Cut Game and Its Strong Equilibria.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

On a Labeled Vehicle Routing Problem.

[BibT_eX]

[DOI]

Hatem Chatti

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

On the Impact of Local Taxes in a Set Cover Game.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2010

Strategic Coloring of a Graph.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

Possible Winners when New Candidates Are Added: The Case of Scoring Rules.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes.

[BibT_eX]

[DOI]

Martin Milanic

Electron. Notes Discret. Math., 2009

On s-t paths and trails in edge-colored graphs.

[BibT_eX]

[DOI]

Fábio Protti

Electron. Notes Discret. Math., 2009

Weighted coloring on planar, bipartite and split graphs: Complexity and approximation.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Selfish Scheduling with Setup Times.

[BibT_eX]

[DOI]

Orestis Telelis

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

On Strong Equilibria in the Max Cut Game.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

The Minimum Reload s-tPath/Trail/Walk Problems.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

2008

A better differential approximation ratio for symmetric TSP.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

A note on the hardness results for the labeled perfect matching problems in bipartite graphs.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2008

Some tractable instances of interval data minmax regret problems.

[BibT_eX]

[DOI]

Olivier Spanjaard

Oper. Res. Lett., 2008

Approximation results for the weighted P4 partition problem.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

Three Selfish Spanning Tree Games.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Cooperation in Multiorganization Matching.

[BibT_eX]

[DOI]

Fanny Pascual

Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality.

[BibT_eX]

[DOI]

Olivier Spanjaard

Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

On Labeled Traveling Salesman Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

Time slot scheduling of compatible jobs.

[BibT_eX]

[DOI]

J. Sched., 2007

The path partition problem and related problems in bipartite graphs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2007

On the Performance of Congestion Games for Optimum Satisfiability Problems.

[BibT_eX]

[DOI]

Aristotelis Giannakos

Proceedings of the Internet and Network Economics, Third International Workshop, 2007

The Complexity of Bottleneck Labeled Graph Problems.

[BibT_eX]

[DOI]

Danny Segev

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

Complexity and Approximation Results for the Connected Vertex Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

The Pk Partition Problem and Related Problems in Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

2006

A simple approximation algorithm for WIS based on the approximability in k.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2006

Reoptimization of Minimum and Maximum Traveling Salesman's Tours.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2006

Approximation Algorithms and Hardness Results for Labeled Connectivity Problems.

[BibT_eX]

[DOI]

Danny Segev

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2005

On the differential approximation of MIN SET COVER.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

The maximum saving partition problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2005

The labeled perfect matching in bipartite graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s).

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2005

A hypocoloring model for batch scheduling.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Approximation algorithms for some vehicle routing problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Greedy Differential Approximations for Min Set Cover.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Weighted Coloring: Further Complexity and Approximability Results.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

Approximation Results for the Weighted P4 Partition Problems.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

(Non)-Approximability for the Multi-criteria TSP(1, 2).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004

Local approximations for maximum partial subgraph problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2003

Optima locaux garantis pour l'approximation différentielle.

[BibT_eX]

[DOI]

Tech. Sci. Informatiques, 2003

Local search for the minimum label spanning tree problem with bounded color classes.

[BibT_eX]

[DOI]

Tobias Brüggemann

Gerhard J. Woeginger

Oper. Res. Lett., 2003

Approximation algorithms for the traveling salesman problem.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2003

Differential approximation results for the Steiner tree problem.

[BibT_eX]

[DOI]

Marc Demange

Appl. Math. Lett., 2003

Bottleneck shortest paths on a partially ordered scale.

[BibT_eX]

[DOI]

Olivier Spanjaard

4OR, 2003

Differential Approximation for Some Routing Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002

Differential approximation of NP-hard problems with equal size feasible solutions.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2002

Differential approximation results for the traveling salesman and related problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Weighted Node Coloring: When Stable Sets Are Expensive.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

2001

The maximum f-depth spanning tree problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2.

[BibT_eX]

[DOI]