Skip to Main content Skip to Navigation
New interface

hal-02277357v1  Conference papers
Marin BougeretKlaus JansenMichael PossLars Rohwedder. Approximation results for makespan minimization with budgeted uncertainty
WAOA 2019 - 17th International Workshop on Approximation and Online Algorithms, Sep 2019, Munich, Germany. pp.60-71, ⟨10.1007/978-3-030-39479-0_5⟩
lirmm-01481787v1  Conference papers
Sancrey Rodrigues AlvesKonrad K. DabrowskiLuerbio FariaSulamita KleinIgnasi Sau Valls et al.  On the (Parameterized) Complexity of Recognizing Well-Covered $(r,l)$-graphs
COCOA: Conference on Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. pp.423-437, ⟨10.1007/978-3-319-48749-6_31⟩
lirmm-01738150v1  Conference papers
Daniel GonçalvesLucas IsenmannClaire Pennarun. Planar Graphs as L-intersection or L-contact graphs
SODA: Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States. pp.172-184, ⟨10.1137/1.9781611975031.12⟩
lirmm-01370305v1  Conference papers
Archontia C. GiannopoulouMichał PilipczukJean-Florent RaymondDimitrios M. ThilikosMarcin Wrochna. Cutwidth: obstructions and algorithmic aspects
IPEC: International symposium on Parameterized and Exact Computation, Aug 2016, Aarhus, Denmark. pp.15:1--15:13, ⟨10.4230/LIPIcs.IPEC.2016.15⟩
hal-03003167v1  Conference papers
Petr A. GolovachGiannos StamoulisDimitrios M. Thilikos. Hitting topological minor models in planar graphs is fixed parameter tractable
SODA 2020 - 31st Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2020, Salt Lake City, UT, United States. pp.931-950, ⟨10.1137/1.9781611975994.56⟩
hal-01733845v1  Conference papers
Julien BasteIgnasi Sau VallsDimitrios M. Thilikos. Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth
IPEC 2017 - 12th International Symposium on Parameterized and Exact Computation, Sep 2017, Vienna, Austria. pp.4:1--4:12, ⟨10.4230/LIPIcs.IPEC.2017.4⟩
lirmm-01890527v1  Conference papers
Julien BasteDimitrios M. Thilikos. Contraction-Bidimensionality of Geometric Intersection Graphs
12th International Symposium on Parameterized and Exact Computation (IPEC 2017), Sep 2017, Vienne, Austria. pp.5:1--5:13, ⟨10.4230/LIPIcs.IPEC.2017.5⟩
lirmm-00782875v1  Conference papers
Marthe BonamyMatthew JohnsonIoannis LignosViresh PatelDaniël Paulusma. On the diameter of reconfiguration graphs for vertex colourings
EuroComb'11: European Conference on Combinatorics, Graph Theory and Applications, Aug 2011, Budapest, Hungary. pp.161-166
lirmm-00433096v1  Conference papers
Louis EsperetDaniel GonçalvesArnaud Labourel. Coloring a set of touching strings
EuroComb'09: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.213-217
lirmm-01083536v1  Conference papers
Christos GiatsidisFragkiskos MalliarosDimitrios M. ThilikosMichalis Vazirgiannis. CORECLUSTER: A Degeneracy Based Graph Clustering Framework
IAAA: Innovative Applications of Artificial Intelligence, Jul 2014, Quebec City, Canada
lirmm-00741936v1  Conference papers
Emeric GioanKevin SolGérard Subsol. Orientations of Simplices Determined by Orderings on the Coordinates of their Vertices
CCCG: Canadian Conference on Computational Geometry, Aug 2011, Toronto, Canada
lirmm-00626116v1  Conference papers
Pascal Ochem. Pattern Avoidance and HDOL Words
WORDS'11: 8th International Conference on Combinatorics on Words, Czech Republic
lirmm-00153984v1  Conference papers
Stéphane BessyJean-Sébastien SereniNicolas Lichiardopol. Two proofs of Bermond-Thomassen conjecture for regular tournaments
6th Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Jul 2007, Prague, République Tchèque, Czech Republic. pp.47-53, ⟨10.1016/j.endm.2007.01.008⟩
inria-00471612v1  Conference papers
Michel HabibChristophe PaulLaurent Viennot. Partition refinement and graph decomposition
Symposium on Discrete Algorithms (SODA), 1999, Baltimore, United States. pp.1-2
lirmm-00106051v1  Conference papers
Christophe PaulJan Arne Telle. Edge Maximal Graphs of Branchwidth k
ICGT'05: International Conference on Graph Theory, 2005
lirmm-00738534v1  Conference papers
Nicolas BousquetDaniel GonçalvesGeorge B. MertziosChristophe PaulIgnasi Sau Valls et al.  Parameterized Domination in Circle Graphs
WG'12: 38th International Workshop on Graph Theoretic Concepts in Computer Science, Jun 2012, Jerusalem, Israel. pp.308-319, ⟨10.1007/978-3-642-34611-8_31⟩
lirmm-00432668v1  Conference papers
Stéphane BessyFedor V. FominSerge GaspersChristophe PaulAnthony Perez et al.  Kernels for Feedback Arc Set In Tournaments
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2009, IIT Kanpur, India. pp.37-47, ⟨10.4230/LIPIcs.FSTTCS.2009.2305⟩
lirmm-01264011v1  Conference papers
Mamadou Moustapha KantéEun Jung KimO-Joung KwonChristophe Paul. An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
10th International Symposium on Parameterized and Exact Computation (IPEC 2015), Sep 2015, Patras, Greece. pp.138-150, ⟨10.4230/LIPIcs.IPEC.2015.138⟩
lirmm-02079017v1  Conference papers
Christophe Paul. Connected tree-width and connected cops and robber game
CAALM 2019 - Complexity, Algorithms, Automata and Logic Meet, Jan 2019, Chennai, India
lirmm-00189511v1  Conference papers
Pinar HeggernessChristophe PaulJan Arne TelleYngve Villanger. Interval Completion with Few Edges
STOC'07: 39th ACM Symposium on Theory of Computing, Jun 2007, San Diego, CA, United States. pp.374-381, ⟨10.1145/1250790.1250847⟩
lirmm-01264015v1  Conference papers
Eun Jung KimSang-Il OumChristophe PaulIgnasi Sau VallsDimitrios M. Thilikos. An FPT 2-Approximation for Tree-cut Decomposition
WAOA: Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.35-46, ⟨10.1007/978-3-319-28684-6_4⟩
lirmm-03872134v1  Conference papers
Zdeněk DvořákDaniel GonçalvesAbhiruk LahiriJane TanTorsten Ueckerdt. On Comparable Box Dimension
SoCG 2022 - 38th International Symposium on Computational Geometry, Jun 2022, Berlin, Germany. pp.38:1--38:14, ⟨10.4230/LIPIcs.SoCG.2022.38⟩
lirmm-00415935v1  Conference papers
Christophe CrespellePhilippe Gambette. Efficient Neighbourhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search
IWOCA'09: 20th International Workshop on Combinatorial Algorithms, Jun 2009, Hradec nad Moravicí, Czech Republic. pp.146-157, ⟨10.1007/978-3-642-10217-2_17⟩
lirmm-01265667v1  Conference papers
Emeric Gioan. A survey on the active bijection in graphs, hyperplane arrangements and oriented matroids
Workshop on the Tutte polynomial, Jul 2015, London, United Kingdom
lirmm-00106049v1  Conference papers
Emeric Gioan. Complete Graph Drawings up to Triangle Mutations
31st International Workshop on Graph-Theoretical Concepts in Computer Science (WG 2005), Jun 2005, Metz, France. pp.139-150, ⟨10.1007/11604686_13⟩