
Christophe Paul
129
Documents
Publications
20
20
20
11
11
8
8
8
7
6
6
6
5
5
5
4
4
4
4
4
4
4
4
4
3
3
3
3
3
3
3
3
3
3
3
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
13
8
7
5
5
5
3
2
2
1
1
1
1
1
1
1
1
1
1
1
1
1
3
2
2
2
5
4
3
5
7
9
10
5
4
6
7
11
7
5
5
7
5
9
3
1
1
1
19
11
8
8
4
2
2
1
1
1
Publications
|
Tree-Layout Based Graph Classes: Proper Chordal GraphsSTACS 2024 - 41st International Symposium on Theoretical Aspects of Computer Science, Mar 2024, Clermont-Ferrand, France. pp.55:1--55:18, ⟨10.4230/LIPICS.STACS.2024.55⟩
Communication dans un congrès
lirmm-04720130
v1
|
|
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: The Case of SurfacesICALP 2024 - 51st International Colloquium on Automata, Languages, and Programming, Jul 2024, Tallin, Estonia. pp.114:1-114:19, ⟨10.4230/LIPIcs.ICALP.2024.114⟩
Communication dans un congrès
lirmm-04702132
v1
|
|
Obstructions to Erdős-Pósa Dualities for MinorsFOCS 2024 - IEEE 65th Annual Symposium on Foundations of Computer Science, Oct 2024, Chicago, United States. pp.31-52, ⟨10.1109/FOCS61266.2024.00013⟩
Communication dans un congrès
lirmm-04825442
v1
|
|
On Dasgupta’s Hierarchical Clustering Objective and Its Relation to Other Graph ParametersFCT 2021 - 23rd International Symposium on Fundamentals of Computation Theory, Sep 2021, Athens, Greece. pp.287-300, ⟨10.1007/978-3-030-86593-1_20⟩
Communication dans un congrès
lirmm-03867040
v1
|
|
Hierarchical Clusterings of Unweighted GraphsMFCS 2020 - 45th International Symposium on Mathematical Foundations of Computer Science, Aug 2020, Prague, Czech Republic. pp.47:1-47:13, ⟨10.4230/LIPIcs.MFCS.2020.47⟩
Communication dans un congrès
lirmm-03027532
v1
|
|
A linear fixed parameter tractable algorithm for connected pathwidthESA 2020 - 28th Annual European Symposium on Algorithms, Sep 2020, Milan, Italy. pp.64:1-64:16, ⟨10.4230/LIPIcs.ESA.2020.64⟩
Communication dans un congrès
hal-03002761
v1
|
|
Connected Search for a Lazy RobberFSTTCS 2019 - 39th IARCS Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2019, Bombay, India. pp.7:1--7:14, ⟨10.4230/LIPIcs.FSTTCS.2019.7⟩
Communication dans un congrès
hal-03003243
v1
|
|
Connected tree-width and connected cops and robber gameCAALM 2019 - Complexity, Algorithms, Automata and Logic Meet, Jan 2019, Chennai, India
Communication dans un congrès
lirmm-02079017
v1
|
A polynomial Turing kernel to compute the cut-width of semi-complete digraphFILOFOCS 2018 - 7th French-Israeli Workshop on Foundations of Computer Science, Oct 2018, Paris, France
Communication dans un congrès
lirmm-02078882
v1
|
|
|
Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Jul 2017, Warsaw, Poland. pp.70:1--70:13, ⟨10.4230/LIPIcs.ICALP.2017.70⟩
Communication dans un congrès
lirmm-02021567
v1
|
|
Parameterized Complexity of the MINCCA Problem on Graphs of Bounded DecomposabilityWG 2016 - 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2016, Istanbul, Turkey. pp.195-206, ⟨10.1007/978-3-662-53536-3_17⟩
Communication dans un congrès
lirmm-01481360
v1
|
|
Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic TreesAAIM: Algorithmic Aspects in Information and Management, Jul 2016, Bergamo, Italy. pp.53-64, ⟨10.1007/978-3-319-41168-2_5⟩
Communication dans un congrès
lirmm-01481368
v1
|
|
On Independent Set on B1-EPG GraphsWAOA 2015 - 13th International Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.158-169, ⟨10.1007/978-3-319-28684-6_14⟩
Communication dans un congrès
lirmm-01264022
v1
|
|
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph HomomorphismIPEC 2015 - 10th International Symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.78-89, ⟨10.4230/LIPIcs.IPEC.2015.78⟩
Communication dans un congrès
lirmm-01263999
v1
|
|
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex DeletionIPEC 2015 - 10th International Symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.138-150, ⟨10.4230/LIPIcs.IPEC.2015.138⟩
Communication dans un congrès
lirmm-01264011
v1
|
|
An FPT 2-Approximation for Tree-cut DecompositionWAOA 2015 - 13th International Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.35-46, ⟨10.1007/978-3-319-28684-6_4⟩
Communication dans un congrès
lirmm-01264015
v1
|
Introduction to parameterized complexity and some algorithmic consequences of the graph minor theoryWorkshop on Graph Theory and its Applications, 2015, Istanbul, Turkey
Communication dans un congrès
lirmm-02078876
v1
|
|
|
A Polynomial-Time Algorithm for Outerplanar Diameter ImprovementCSR: Computer Science in Russia, Jul 2015, Listvyanka, Russia. pp.123-142, ⟨10.1007/978-3-319-20297-6_9⟩
Communication dans un congrès
hal-01178222
v1
|
Recognition of dynamic circle graphsICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France
Communication dans un congrès
hal-01178215
v1
|
|
|
Parameterized domination in circle graphsWG 2012 - 38th International Workshop on Graph Theoretic-Concepts in Computer Science, Jun 2012, Jerusalem, Israel. pp.45-72, ⟨10.1007/s00224-013-9478-8⟩
Communication dans un congrès
lirmm-00738534
v1
|
|
Hadwiger Number of Graphs with Small ChordalityWG 2014 - 40th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2014, Nouan-le-Fuzelier, France. pp.201-213, ⟨10.1007/978-3-319-12340-0_17⟩
Communication dans un congrès
hal-01178217
v1
|
|
Explicit linear kernels via dynamic programmingSTACS 2014 - 31st International Symposium on Theoretical Aspects of Computer Science, Mar 2014, Lyon, France. pp.312-324, ⟨10.4230/LIPIcs.STACS.2014.312⟩
Communication dans un congrès
hal-01084007
v1
|
|
Linear Kernels and Single-exponential Algorithms via Protrusion DecompositionsICALP: International Colloquium on Automata, Languages and Programming, Jul 2013, Riga, Latvia. pp.613-624, ⟨10.1007/978-3-642-39206-1_52⟩
Communication dans un congrès
lirmm-00829999
v1
|
Complexité et algorithmes paramétrésEcole Jeunes Chercheurs en Informatique Mathématique, 2013, Perpignan, France
Communication dans un congrès
hal-01178227
v1
|
|
Algorithmics of Modular DecompositionAlgorithms and Permutations, Feb 2012, Paris, France
Communication dans un congrès
lirmm-00805415
v1
|
|
Parameterized K_4-Cover in Single Exponential TimeSWAT: Scandinavian Workshop on Algorithmic Theory, Jul 2012, Helsinki, Sweden. pp.199-130
Communication dans un congrès
lirmm-00805191
v1
|
|
|
Obtaining a Bipartite Graph by Contracting Few EdgesIARCS 31st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011), Dec 2011, Mumbai, India. pp.217-228, ⟨10.4230/LIPIcs.FSTTCS.2011.217⟩
Communication dans un congrès
lirmm-00805189
v1
|
|
Hitting and Harvesting PumpkinsESA 2011 - 19th Annual European Symposium on Algorithms, Sep 2011, Saarbrücken, Germany. pp.394-407, ⟨10.1007/978-3-642-23719-5_34⟩
Communication dans un congrès
lirmm-00642341
v1
|
|
Contracting Graphs to Paths and TreesIPEC 2011 - 6th International Symposium on Parameterized and Exact Computation, Sep 2011, Saarbrücken, Germany. pp.55-66, ⟨10.1007/978-3-642-28050-4_5⟩
Communication dans un congrès
lirmm-00805183
v1
|
Conflict Packing Yield Linear Vertex-Kernels for k- Fast, $k-Dense$ RTI and a Related Problem36th International Symposium on Mathematical Foundations of Computer Science (MFCS 2011), Aug 2011, Warsaw, Poland. pp.497-507, ⟨10.1007/978-3-642-22993-0_45⟩
Communication dans un congrès
istex
lirmm-00642335
v1
|
|
Contracting Chordal Graphs and Bipartite Graphs to Paths and TreesLAGOS: Latin-American Algorithms, Graphs and Optimization Symposium, Mar 2011, Bariloche, Argentina. pp.87-92
Communication dans un congrès
lirmm-00620732
v1
|
|
Generalized Graph Clustering: Recognizing (p,q)-ClusterWG'10: International Workshop on Graph Theoretic Concepts in Computer Science, Jun 2010, Zarós, Greece. pp.12
Communication dans un congrès
lirmm-00533520
v1
|
|
|
On the (Non-)Existence of Polynomial Kernels for Pl -Free Edge Modification ProblemsIPEC 2010 - 5th International Symposium on Parameterized and Exact Computation, Dec 2010, Chennai, India. pp.147-157, ⟨10.1007/978-3-642-17493-3_15⟩
Communication dans un congrès
lirmm-00533519
v1
|
|
Milling a Graph with Turn Costs: a Parameterized Complexity PerspectiveWG 2010 - 36th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2010, Zarós, Greece. pp.123-134, ⟨10.1007/978-3-642-16926-7_13⟩
Communication dans un congrès
lirmm-00533521
v1
|
|
The Structure of Level-k Phylogenetic NetworksCPM: Combinatorial Pattern Matching, Jun 2009, Lille, France. pp.289-300, ⟨10.1007/978-3-642-02441-2_26⟩
Communication dans un congrès
lirmm-00371485
v1
|
|
Kernels for Feedback Arc Set In TournamentsIARCS 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⟩
Communication dans un congrès
lirmm-00432668
v1
|
Polynomial Kernels for 3-Leaf Power Graph Modification ProblemsIWOCA'09: International Workshop on Combinatorial Algorithms, pp.72-82
Communication dans un congrès
lirmm-00432664
v1
|
|
|
Perfect DCJ rearrangementRECOMB-CG: Comparative Genomics, Oct 2008, Paris, France. pp.158-169, ⟨10.1007/978-3-540-87989-3_12⟩
Communication dans un congrès
lirmm-00327258
v1
|
|
A Note on α-Drawable k-TreesCCCG 2008 - 20th Annual Canadian Conference on Computational Geometry, Aug 2008, Montréal, Québec, Canada. pp.23-26
Communication dans un congrès
lirmm-00324589
v1
|
Simple, Linear-Time Modular DecompositionICALP: International Colloquium on Automata, Languages and Programming, Jul 2008, Reykjavik, Iceland. pp.634-645
Communication dans un congrès
lirmm-00324557
v1
|
|
Kinetic Maintenance of Mobile k-Centre in TreesISAAC'07: 18th International Symposium on Algorithms and Computation, 2007, Sendei, Japan. pp.341-352
Communication dans un congrès
lirmm-00189505
v1
|
|
|
Interval Completion with Few EdgesSTOC'07: 39th ACM Symposium on Theory of Computing, Jun 2007, San Diego, CA, United States. pp.374-381, ⟨10.1145/1250790.1250847⟩
Communication dans un congrès
lirmm-00189511
v1
|
Dynamic Distance Hereditary Graphs Using Split DecompositionISAAC'07: 18th International Symposium on Algorithms and Computation, 2007, Sendei, Japan. pp.41-51
Communication dans un congrès
lirmm-00189506
v1
|
|
|
Algorithmic Generation of Graphs of Branch-width ≤ kWG 2006 - 32nd International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2006, Bergen, Norway. pp.206-216, ⟨10.1007/11917496_19⟩
Communication dans un congrès
lirmm-00324551
v1
|
|
On the Approximation of Computing Evolutionary TreesCOCOON: Computing and Combinatorics Conference, Aug 2005, Kunming, China. pp.115-125, ⟨10.1007/11533719_14⟩
Communication dans un congrès
istex
lirmm-00106451
v1
|
|
New Tools and Simpler Algorithms for BranchwidthESA 2003 - 13rd Annual European Symposium on Algorithms, Oct 2005, Palma de Mallorca, Spain. pp.379-390, ⟨10.1007/11561071_35⟩
Communication dans un congrès
lirmm-00106466
v1
|
Revisiting Uno and Yagiura's AlgorithmsISAAC'05: 16th Annual Symposium on Algorithms and Computation, 2005
Communication dans un congrès
lirmm-00106037
v1
|
|
|
Perfect Sorting by Reversal is not Always DifficultWABI: Workshop on Algorithms in Bioinformatics, Oct 2005, Mallorca, Spain. pp.228-238, ⟨10.1007/11557067_19⟩
Communication dans un congrès
lirmm-00106465
v1
|
Fully Dynamic Algorithm for Modular Decomposition and Recognition of Permutation GraphsWG'05: 31st International Workshop on Graph Theoretical Concepts in Computer Science, Jun 2005, Metz, France. pp.38-48, ⟨10.1007/11604686_4⟩
Communication dans un congrès
istex
lirmm-00106039
v1
|
|
|
Fully-Dynamic Recognition Algorithm and Certificate for Directed CographsWG 2004 - 30th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2004, Bad Honnef, Germany. pp.93-104
Communication dans un congrès
lirmm-00108770
v1
|
|
A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order ExtensionSWAT 2004 - 9th Scandinavian Workshop on Algorithm Theory, Jul 2004, Humlebaek, Denmark. pp.187-198, ⟨10.1007/978-3-540-27810-8_17⟩
Communication dans un congrès
hal-00159601
v1
|
|
Maximal Common Connected Sets of Interval GraphsCPM: Combinatorial Pattern Matching, 2004, Istanbul, Turkey. pp.359-372, ⟨10.1007/978-3-540-27801-6_27⟩
Communication dans un congrès
lirmm-00108787
v1
|
Eclectisme dans les petits mondesAlgoTel: Aspects Algorithmiques des Télécommunications, May 2004, Lyon, France. pp.270-284
Communication dans un congrès
hal-00307396
v1
|
|
Eclecticism Shrinks Even Small Worlds$23^{rd}$ Annual ACM Symposium on Principles of Distributed Computing (PODC), 2004, Canada. pp.169-178
Communication dans un congrès
hal-00307394
v1
|
|
|
A Linear-Time Algorithm for Recognition of Catval GraphsEuroComb: European Conference on Combinatorics, Graph Theory and Applications, 2003, Prague, Czech Republic
Communication dans un congrès
lirmm-00269443
v1
|
|
Approximate Multicommodity Flow for WDM Networks DesignSIROCCO: Structural Information and Communication Complexity, Jun 2003, Umeä, Sweden. pp.43-56
Communication dans un congrès
lirmm-00269524
v1
|
Optimal Distance Labeling Schemes for Interval and Circular-arc Graphs$11^{th}$ Annual European Symposium on Algorithms (ESA), 2003, United States. pp.254-265
Communication dans un congrès
hal-00307388
v1
|
|
On Poset Sandwich ProblemsEuroComb: European Conference on Combinatorics, Graph Theory and Applications, 2003, Prague, Czech Republic
Communication dans un congrès
lirmm-00269577
v1
|
|
A Simple Linear Time LexBFS Cograph Recognition AlgorithmWG 2003 - 29th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2003, Elspeet, Netherlands. pp.119-130, ⟨10.1007/978-3-540-39890-5_11⟩
Communication dans un congrès
istex
lirmm-00269525
v1
|
|
Optimal Distance Labeling for Interval and Circular-Arc GraphsESA 2003 - 11th Annual European Symposium on Algorithms, Sep 2003, Budapest, Hungary. pp.254-265, ⟨10.1007/978-3-540-39658-1_25⟩
Communication dans un congrès
istex
lirmm-00269576
v1
|
|
|
Partition refinement and graph decompositionSymposium on Discrete Algorithms (SODA), 1999, Baltimore, United States. pp.1-2
Communication dans un congrès
inria-00471612
v1
|
|
A Synthesis on Partition Refinement: a Usefull Routine for Strings, Graphs, Boolean Matrices and AutomataSTACS: Symposium on Theoretical Aspects of Computer Science, Feb 1998, Paris, France. pp.25-38, ⟨10.1007/BFb0028546⟩
Communication dans un congrès
istex
inria-00471611
v1
|
WG'09: International Workshop on Theoretic Concepts in Computer Science5911, 352 p., 2010, Lecture Notes in Computer Science
Ouvrages
lirmm-00533518
v1
|
Split decomposition, circle graphs and related graph familiesMing-Yang Kao. Encyclopedia of Algorithms, 2051-2056, Springer, 2015, 978-1-4939-2863-7. ⟨10.1007/978-1-4939-2864-4_686⟩
Chapitre d'ouvrage
hal-01178198
v1
|
|
Complexité et algorithmes paramétrésPhilippe Langlois. Informatique mathématique, une photographie en 2013, Presse universitaires de Perpignan, 2013
Chapitre d'ouvrage
hal-01178225
v1
|
|
Aspects algorithmiques de la décomposition modulaireMathématiques [math]. Université Montpellier II - Sciences et Techniques du Languedoc, 2006
HDR
tel-00112390
v1
|
Chargement...
Chargement...