Publications du thème Algorithmique, Graphes, Complexité

issues de la collection LIMOS de HAL
169 documents
Pour toutes les publis du LIMOS, cliquez ici


Date publi
Type
Co-auteurs
Titre
journal ou conférence
Domaines
2025
ART
Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen
Distance-based (and path-based) covering problems for graphs of given cyclomatic number
Discrete Mathematics - 2025
Informatique/Mathématique discrète
2025
COMM
Antoine Dailly, Harmender Gahlawat, Zin Mar Myint
The Closed Geodetic Game: algorithms and strategies
International Workshop on Combinatorial Algorithms - 2025
Informatique/Mathématique discrète
2025
COMM
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
Structural Parameterization of Locating-Dominating Set and Test Cover
Proceedings of the 14th International Conference on Algorithms and Complexity (CIAC 2025) - 2025
Informatique/Algorithme et structure de données
2025
UNDEFINED
Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
The Canadian Traveller Problem on unit-weighted and arbitrarily weighted outerplanar graphs
2025
UNDEFINED
Dipayan Chakraborty, Florent Foucaud, Michael Antony Henning, Tero Laihonen
A note on partitioning the vertex set of a graph into a dominating set and a locating dominating set
Maths
2025
ART
Tapas Das, Florent Foucaud, Clara Marcille, P.D. Pavan, Sagnik Sen
Monitoring arc-geodetic sets of oriented graphs
Theoretical Computer Science - 2025
Informatique/Mathématique discrète
2025
ART
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-Il Oum, Michal Pilipczuk, Erik Leeuwen
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
ACM Transactions on Computation Theory - 2025
Informatique/Mathématique discrète
2025
COMM
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Metric Dimension and Geodetic Set Parameterized by Vertex Cover
42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025) - 2025
Informatique/Algorithme et structure de données
2025
UNDEFINED
Louis Esperet, Harmender Gahlawat, Ugo Giocanti
Coarse cops and robber in graphs and groups
Maths
2025
UNDEFINED
Aude Marêché, Isabelle Debled-Rennesson, Fabien Feschet, Phuc Ngo
Local Fan of Digital Planes for Parameter-Free Normal Vector Estimation on Digital Surfaces
2025
COMM
Florent Foucaud, Atrayee Majumder, Tobias Mömke, Aida Roshany-Tabrizi
Polynomial-time algorithms for Path Cover on trees and graphs of bounded treewidth
10th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2025) - 2025
Informatique/Algorithme et structure de données
2025
UNDEFINED
Antoine Dailly, Florent Foucaud, Anni Hakanen
Algorithms and hardness for Metric Dimension on digraphs
Informatique/Mathématique discrète
2025
ART
Dipayan Chakraborty, Soumen Nandi, Sagnik Sen, D.K. Supraja
A linear algorithm for radio k-coloring of powers of paths having small diameters
Journal of Computer and System Sciences - 2025
Maths
2025
UNDEFINED
Laurent Beaudou, Jan Bok, Florent Foucaud, Daniel A. Quiroz, Jean-Florent Raymond
Profile and neighbourhood complexity of graphs with excluded minors and tree-structured graphs
Informatique/Mathématique discrète
2025
ART
Fabien Feschet, Jacques-Olivier Lachaud
New Properties for Full Convex Sets and Full Convex Hulls
Journal of Mathematical Imaging and Vision - 2025
2025
COMM
Pierre Bergé, Guillaume Ducoffe, Michel Habib
Quasilinear-time eccentricities computation, and more, on median graphs
SODA 2025 - 2025
Informatique/Algorithme et structure de données
2025
ART
Florent Foucaud, Clara Marcille, Zin Mar Myint, R.B. Sandeep, Sagnik Sen, S. Taruni
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
Discrete Applied Mathematics - 2025
Informatique/Mathématique discrète
2025
ART
Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, Rajath Rao K.N.
Parameterizing Path Partitions
Theoretical Computer Science - 2025
Informatique/Mathématique discrète
2024
UNDEFINED
Dipayan Chakraborty, Annegret K. Wagler
On lower bounds for cardinalities of several separating-dominating codes in graphs
Informatique/Mathématique discrète
2024
COMM
Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté, Eun Jung Kim, Noleen Köhler
CMSO-transducing tree-like graph decompositions
STACS 2025 - 2024
Informatique/Théorie et langage formel
2024
THESE
Dipayan Chakraborty
Structural and algorithmic aspects of identification problems in graphs
Informatique/Mathématique discrète
2024
COMM
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
Proceedings of the 35th International Symposium on Algorithms and Computation (ISAAC 2024) - 2024
Maths
2024
ART
Jan Bok, Jiří Fiala, Nikola Jedličková, Jan Kratochvíl, Michaela Seifrtová
Computational complexity of covering disconnected multigraphs
Discrete Applied Mathematics - 2024
Maths
2024
ART
Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael Henning, Annegret Wagler
Progress towards the two-thirds conjecture on locating-total dominating sets
Discrete Mathematics - 2024
Informatique/Mathématique discrète
2024
COMM
Sebastian Siebertz, Alexandre Vigny
Advances in Algorithmic Meta Theorems (Invited Paper)
44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024) - 2024
2024
ART
Lhouari Nourine, Jean-Marc Petit, Simon Vilmin
Towards declarative comparabilities: Application to functional dependencies
Journal of Computer and System Sciences - 2024
Informatique/Base de données
2024
UNDEFINED
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
Structural Parameterization of Locating-Dominating Set and Test Cover
Informatique/Algorithme et structure de données
2024
UNDEFINED
Florent Foucaud, Clara Marcille, R. Sandeep, Sagnik Sen, S Taruni
Algorithms and complexity for monitoring edge-geodetic sets in graphs
Informatique/Algorithme et structure de données
2024
UNDEFINED
Vsevolod Chernyshev, Johannes Rauch, Dieter Rautenbach
Forest Cuts in Sparse Graphs
Maths
2024
UNDEFINED
Antoine Dailly, Harmender Gahlawat, Zin Mar Myint
The Closed Geodetic Game: algorithms and strategies
Informatique/Mathématique discrète
2024
COMM
Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
The Canadian Traveller Problem on Outerplanar Graphs
Mathematical Foundations of Computer Science (MFCS) - 2024
Informatique/Algorithme et structure de données
2024
COMM
Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing
Algorithms and Complexity for Path Covers of Temporal DAGs
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024) - 2024
Informatique/Algorithme et structure de données
2024
COMM
Mohammed Elaroussi, Lhouari Nourine, Simon Vilmin
Half-space separation in monophonic convexity
Mathematical Foundation of Computer Science (MFCS) - 2024
Informatique/Mathématique discrète
2024
ART
Ocyna Rudmann, Anatolia Batruch, Emilio Paolo Visintin, Nicolas Sommet, Pascal Bressoux, Céline Darnon, Marinette Bouet, Marco Bressan, Genavee Brown, Carlos Cepeda, Anthony Cherbonnier, Marie Demolliens, Anne-Laure de Place, Olivier Desrichard, Théo Ducros, Luc Goron, Brivael Hemon, Pascal Huguet, Eric Jamet, Ruben Martinez, Vincent Mazenod, Nathalie Mella, Estelle Michinov, Nicolas Michinov, Nana Ofosu, Pascal Pansu, Laurine Peter, Benoit Petitcollot, Celine Poletti, Isabelle Régner, Mathilde Riant, Anais Robert, Camille Sanrey, Arnaud Stanczak, Farouk Toumani, Simon Vilmin, Eva Vives, Fabrizio Butera
Cooperative learning reduces the gender gap in perceived social competences: A large-scale nationwide longitudinal experiment
Journal of Educational Psychology - 2024
Sciences de l'homme et de la societe
2024
UNDEFINED
Dipayan Chakraborty, Florent Foucaud, Michael Henning, Tuomo Lehtilä
Identifying codes in triangle-free graphs of bounded maximum degree
Maths
2024
ART
Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret K Wagler
On three domination-based identification problems in block graphs
Fundamenta Informaticae - 2024
Informatique/Mathématique discrète
2024
UNDEFINED
Dipayan Chakraborty, Florent Foucaud, Michael Henning, Tuomo Lehtilä
Identifying codes in graphs of given maximum degree: Characterizing trees
Informatique/Mathématique discrète
2024
UNDEFINED
Dipayan Chakraborty, Annegret K. Wagler
On full-separating sets in graphs
Informatique/Mathématique discrète
2024
UNDEFINED
Dipayan Chakraborty, Florent Foucaud, Michael Henning
Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
Maths
2024
COMM
Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios Thilikos, Alexandre Vigny
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes
LICS 2024 - 39th ACM/IEEE Symposium on Logic in Computer Science - 2024
Informatique/Logique en informatique
2024
COMM
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Problems in NP can admit double-exponential lower bounds when parameterized by treewidth or vertex cover
Proceedings of the 51st EATCS International Colloquium on Automata, Languages, and Programming (ICALP 2024) - 2024
Informatique/Algorithme et structure de données
2024
COMM
Jan Bok, Antoine Dailly, Tuomo Lehtilä
Resolving Sets in Temporal Graphs
International Workshop on Combinatorial Algorithms - 2024
Maths
2024
UNDEFINED
Dipayan Chakraborty, Anni Hakanen, Tuomo Lehtilä
The n/2-bound for locating-dominating sets in subcubic graphs
Informatique/Mathématique discrète
2024
COMM
Aude Marêché, Isabelle Debled-Rennesson, Fabien Feschet, Phuc Ngo
A Parameter-Free Normal Estimator on Digital Surfaces
4th International Conference on Intelligent Systems and Pattern Recognition (ISPR) - 2024
2024
UNDEFINED
Antoine Dailly, Valentin Gledel, Richard J Nowakowski, Carlos Pereira dos Santos
Simple Chopsticks: Playing with any number of hands and fingers
Maths
2024
COMM
Guilherme D. da Fonseca, Yan Gerard
Shadoks Approach to Knapsack Polygonal Packing (CG Challenge)
40th International Symposium on Computational Geometry (SoCG 2024) - 2024
2024
ART
Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca
On Graphs Coverable by k Shortest Paths
SIAM Journal on Discrete Mathematics - 2024
Informatique/Mathématique discrète
2024
COMM
Antoine Dailly, Pascal Lafourcade, Gael Marcadet
How did they design this game? Swish: complexity and unplayable positions
12th International Conference on Fun with Algorithms (FUN 2024) - 2024
Informatique/Mathématique discrète
2024
ART
Jan Bok, Richard Brewster, Tomás Feder, Pavol Hell, Nikola Jedličková
List homomorphisms to separable signed graphs
Theoretical Computer Science - 2024
Maths
2024
ART
Mathilde Riant, Anne-Laure de Place, Pascal Bressoux, Anatolia Batruch, Marinette Bouet, Marco Bressan, Genavee Brown, Fabrizio Butera, Carlos Cepeda, Anthony Cherbonnier, Céline Darnon, Marie Demolliens, Olivier Desrichard, Théo Ducros, Luc Goron, Brivael Hémon, Pascal Huguet, Eric Jamet, Ruben Martinez, Vincent Mazenod, Nathalie Mella, Estelle Michinov, Nicolas Michinov, Nana Ofosu, Laurine Peter, Benoît Petitcollot, Céline Poletti, Isabelle Régner, Anaïs Robert, Ocyna Rudmann, Camille Sanrey, Arnaud Stanczak, Farouk Toumani, Simon Vilmin, Emilio Paolo Visintin, Eva Vives, Pascal Pansu
Does the Jigsaw method improve motivation and self-regulation in vocational high schools?
Contemporary Educational Psychology - 2024
Sciences de l'homme et de la societe
2024
ART
Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny
Elimination Distance to Bounded Degree on Planar Graphs Preprint
Fundamenta Informaticae - 2024
Informatique/Mathématique discrète
2024
COMM
Dipayan Chakraborty, Annegret Wagler
Open-Separating Dominating Codes in Graphs
International Symposium on Combinatorial Optimization - 2024
Maths
2024
COMM
Pierre Bergé, Mari Chaikovskaia, Jean-Philippe Lucien Gayon, Alain Quilliot
Approximation Algorithm for Job Scheduling with Reconfigurable Resources
International Symposium on Combinatorial Optimisation - ISCO 2024 - 2024
Informatique/Recherche opérationnelle
2024
ART
Daniel Gonçalves, Vincent Limouzy, Pascal Ochem
Contact graphs of boxes with unidirectional contacts
Discrete Mathematics and Theoretical Computer Science - 2024
Informatique/Mathématique discrète
2024
ART
Laurent Beaudou, Penny Haxell, Kathryn Nurse, Sagnik Sen, Zhouningxin Wang
Density of 3‐critical signed graphs
Journal of Graph Theory - 2024
Maths
2024
UNDEFINED
Dipayan Chakraborty, Annegret K. Wagler
Open-separating dominating codes in graphs
Informatique/Mathématique discrète
2024
UNDEFINED
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Metric Dimension and Geodetic Set Parameterized by Vertex Cover
Informatique/Algorithme et structure de données
2024
COMM
Fabien Feschet, Jacques-Olivier Lachaud
New Characterizations of Full Convexity
International Conference on Discrete Geometry and Mathematical Morphology - 2024
Maths
2024
ART
Florent Foucaud, Narges Ghareghani, Pouyeh Sharifani
Extremal digraphs for open neighbourhood location-domination and identifying codes
Discrete Applied Mathematics - 2024
Informatique/Mathématique discrète
2024
ART
Jan Bok, Richard Brewster, Pavol Hell, Nikola Jedličková, Arash Rafiey
Min Orderings and List Homomorphism Dichotomies for Graphs and Signed Graphs
Algorithmica - 2024
Maths
2024
ART
Laurent Beaudou, Caroline Brosse, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
Discrete Mathematics and Theoretical Computer Science - 2024
Informatique/Mathématique discrète
2024
UNDEFINED
Kira Adaricheva, Lhouari Nourine, Simon Vilmin
Computing the D-base and D-relation in finite closure systems
Informatique/Complexité
2024
COMM
Guilherme da Fonseca, Yan Gerard, Bastien Rivier
Short Flip Sequences to Untangle Segments in the Plane ⋆
WALCOM 2024 - 2024
2024
ART
Caroline Brosse, Aurélie Lagoutte, Vincent Limouzy, Arnaud Mary, Lucas Pastor
Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes
Discrete Applied Mathematics - 2024
2024
PROCEEDINGS
Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov
LIPIcs, Volume 289, STACS 2024, Complete Volume
2024
UNDEFINED
Jan Bok, Antoine Dailly, Tuomo Lehtilä
Resolving Sets in Temporal Graphs
Informatique/Mathématique discrète
2024
UNDEFINED
Bogdan Alecu, Mamadou Moustapha Kanté, Vadim Lozin, Viktor Zamaraev
Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
Informatique/Mathématique discrète
2024
UNDEFINED
Kyle Burke, Antoine Dailly, Nacim Oijid
Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles
Informatique/Mathématique discrète
2024
COMM
Silvia Bianchi, Dipayan Chakraborty, Yanina Lucarini, Annegret Wagler
Location-Domination Type Problems Under the Mycielski Construction
International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), 2024 - 2024
Maths
2024
COMM
Florent Foucaud, Pierre-Marie Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni
Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity
10th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2024) - 2024
Informatique/Mathématique discrète
2024
UNDEFINED
Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing
Algorithms and complexity for path covers of temporal DAGs
Informatique/Mathématique discrète
2024
UNDEFINED
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
Informatique/Algorithme et structure de données
2024
ART
Pierre Bergé, Guillaume Ducoffe, Michel Habib
Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs
Theory of Computing Systems - 2024
Informatique/Algorithme et structure de données
2024
UNDEFINED
Mamadou Moustapha Kanté, Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno
Listing Maximal H-Free Subgraphs
Informatique/Complexité
2024
ART
Anni Hakanen, Ville Junnila, Tero Laihonen, Ismael Yero
On the unicyclic graphs having vertices that belong to all their (strong) metric bases
Discrete Applied Mathematics - 2024
Maths
2024
ART
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D.K. Supraja
On locating and neighbor-locating colorings of sparse graphs
Discrete Applied Mathematics - 2024
Informatique/Mathématique discrète
2024
ART
Alexey Barsukov, Mamadou Moustapha Kanté
Generalisations of matrix partitions: Complexity and obstructions
Theoretical Computer Science - 2024
Informatique/Mathématique discrète
2024
REPORT
Pierre Bergé, Mari Chaikovskaia, Jean-Philippe Lucien Gayon, Alain Quilliot
Approximation algorithms for Job Scheduling with reconfigurable resources
2024
ART
Édouard Bonnet, Florent Foucaud, Tuomo Lehtilä, Aline Parreau
Neighbourhood complexity of graphs of bounded twin-width
European Journal of Combinatorics - 2024
Informatique/Mathématique discrète
2024
ART
Anni Hakanen, Ismael Yero
Complexity and equivalency of multiset dimension and ID-colorings
Fundamenta Informaticae - 2024
Informatique/Mathématique discrète
2023
ART
Liliana Alcón, Martin Charles Golumbic, Noemí Gudiño, Marisa Gutierrez, Vincent Limouzy
On dually-CPT and strong-CPT posets
Order - 2023
Informatique/Mathématique discrète
2023
UNDEFINED
Sandip Das, Florent Foucaud, Sk Samim Islam, Joydeep Mukherjee
Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs
Informatique/Mathématique discrète
2023
HDR
Yan Gerard
Lost in the Grid
2023
UNDEFINED
Silvia M. Bianchi, Dipayan Chakraborty, Yanina Lucarini, Annegret K. Wagler
Location-Domination Type Problems Under the Mycielski Construction
Informatique/Mathématique discrète
2023
UNDEFINED
Subhadeep Dev, Sanjana Dey, Florent Foucaud, Narayanan Krishna, Lekshmi Ramasubramony Sulochana
Monitoring edge-geodetic sets in graphs
Informatique/Mathématique discrète
2023
ART
Thomas Bellitto, Caroline Brosse, Benjamin Lévêque, Aline Parreau
Locating Dominating Sets in local tournaments
Discrete Applied Mathematics - 2023
Maths
2023
PROCEEDINGS
Dipayan Chakraborty, R. Sandeep
Contracting Edges to Destroy a Pattern: A Complexity Study
Maths
2023
COMM
Dipayan Chakraborty, Florent Foucaud, Tuomo Lehtilä
Identifying codes in bipartite graphs of given maximum degree
12th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2023) - 2023
Informatique/Mathématique discrète
2023
COMM
Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen
Distance-Based Covering Problems for Graphs of Given Cyclomatic Number
24th International Symposium on Fundamentals of Computation Theory (FCT 2023) - 2023
Informatique/Mathématique discrète
2023
ART
Antoine Dailly, Elżbieta Sidorowicz
Neighbour sum distinguishing edge-weightings with local constraints
Discrete Applied Mathematics - 2023
Informatique/Mathématique discrète
2023
THESE
Caroline Brosse
Efficient enumeration algorithms for minimal graph completions and deletions
Informatique/Algorithme et structure de données
2023
ART
Virginia Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond
A lower bound for constant-size local certification
Theoretical Computer Science - 2023
Informatique/Mathématique discrète
2023
UNDEFINED
Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa
On the hardness of inclusion-wise minimal separators enumeration
Informatique/Mathématique discrète
2023
COMM
Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud, Yann Vaxès
Isometric Path Complexity of Graphs
48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023) - 2023
Informatique/Mathématique discrète
2023
ART
Yan Gerard
Reconstruction of Convex Sets from One or Two X-rays
Fundamenta Informaticae - 2023
2023
ART
Lhouari Nourine, Simon Vilmin
The enumeration of meet-irreducible elements based on hierarchical decompositions of implicational bases
Theoretical Computer Science - 2023
Informatique/Mathématique discrète
2023
ART
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
The RED-BLUE SEPARATION problem on graphs
Theoretical Computer Science - 2023
Informatique/Mathématique discrète
2023
ART
Fabien Feschet, Jacques-Olivier Lachaud
An Envelope Operator for Full Convexity to Define Polyhedral Models in Digital Spaces
Journal of Mathematical Imaging and Vision - 2023
2023
UNDEFINED
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover
Informatique/Algorithme et structure de données
2023
ART
Florent Foucaud, Reza Naserasr, Rongxing Xu
Extended Double Covers and Homomorphism Bounds of Signed Graphs
The Electronic Journal of Combinatorics - 2023
Informatique/Mathématique discrète
2023
ART
Florent Foucaud, Tuomo Lehtilä
Bounds and Extremal Graphs for Total Dominating Identifying Codes
The Electronic Journal of Combinatorics - 2023
Informatique/Mathématique discrète
2023
ART
Sanjana Dey, Florent Foucaud, Subhas Nandy, Arunabha Sen
Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups
Algorithmica - 2023
Informatique/Mathématique discrète
2023
COMM
Antoine Dailly, Florent Foucaud, Anni Hakanen
Algorithms and Hardness for Metric Dimension on Digraphs
49th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2023) - 2023
Informatique/Mathématique discrète
2023
COMM
Jan Bok, Jiří Fiala, Nikola Jedličková, Jan Kratochvíl, Michaela Seifrtová
Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)
The 49th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2023 - 2023
Maths
2023
COMM
Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, K. N. Rajath Rao
Parameterizing Path Partitions
13th International Conference on Algorithms and Complexity (CIAC 2023) - 2023
Informatique/Algorithme et structure de données
2023
COMM
Dipayan Chakraborty, Soumen Nandi, Sagnik Sen, D. Supraja
A Linear Algorithm for Radio k-Coloring Powers of Paths Having Small Diameter
34th International Workshop on Combinatorial Algorithms - 2023
Informatique/Mathématique discrète
2023
UNDEFINED
Laurent Beaudou, Florent Foucaud, Florent Madelaine, Lhouari Nourine, Gaétan Richad
Complexity of conjunctive regular path query homomorphisms
Informatique/Base de données
2023
ART
Mamadou Moustapha Kanté, Eun Jung Kim, O-Joung Kwon, Sang-Il Oum
Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k
Journal of Combinatorial Theory, Series B - 2023
Informatique/Mathématique discrète
2023
ART
Alexandre Bazin, Laurent Beaudou, Giacomo Kahn, Kaveh Khoshkhah
Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs
Discrete Mathematics and Theoretical Computer Science - 2023
Informatique/Mathématique discrète
2023
ART
Arun Kumar Das, Sandip Das, Guilherme da Fonseca, Yan Gerard, Bastien Rivier
Complexity results on untangling red-blue matchings
Computational Geometry - 2023
2023
ART
Loïc Crombez, Guilherme da Fonseca, Florian Fontan, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso, Benjamin Momège, Jack Spalding-Jamieson, Brandon Zhang, da Wei Zheng
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring
ACM Journal of Experimental Algorithmics - 2023
2023
COMM
Guilherme da Fonseca, Yan Gerard, Bastien Rivier
On the Longest Flip Sequence to Untangle Segments in the Plane
WALCOM 17th International Conference and Workshops on Algorithms and Computation - 2023
2023
PROCEEDINGS
Petra Berenbrink, Patricia Bouyer, Anuj Dawar, Mamadou Moustapha Kanté
LIPIcs, Volume 254, STACS 2023, Complete Volume
2023
ART
Mohammed Elaroussi, Lhouari Nourine, Mohammed Said Radjef, Simon Vilmin
On the preferred extensions of argumentation frameworks: Bijections with naive sets
Information Processing Letters - 2023
Informatique/Mathématique discrète
2023
COMM
Florent Foucaud, Krishna Narayanan, Lekshmi Ramasubramony Sulochana
Monitoring edge-geodetic sets in graphs
9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2023) - 2023
Informatique/Mathématique discrète
2023
COMM
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D K Supraja
New Bounds and Constructions for Neighbor-Locating Colorings of Graphs
9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2023) - 2023
Informatique/Mathématique discrète
2023
COMM
Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret Wagler
On Three Domination-Based Identification Problems in Block Graphs
9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2023) - 2023
Informatique/Mathématique discrète
2023
COMM
Sandip Das, Florent Foucaud, Sk Samim Islam, Joydeep Mukherjee
Relation Between Broadcast Domination and Multipacking Numbers on Chordal Graphs
9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2023) - 2023
Informatique/Mathématique discrète
2023
ART
Claire Hilaire, Jean-Florent Raymond
Long induced paths in minor-closed graph classes and beyond
The Electronic Journal of Combinatorics - 2023
Informatique/Mathématique discrète
2023
UNDEFINED
Daniel Gonçalves, Vincent Limouzy, Pascal Ochem
Contact graphs of boxes with unidirectional contacts
Informatique/Mathématique discrète
2023
COMM
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-Il Oum, Michal Pilipczuk, Erik Leeuwen
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
31st Annual European Symposium on Algorithms - 2023
Informatique/Mathématique discrète
2023
ART
Marthe Bonamy, Oscar Defrain, Tereza Klimošová, Aurélie Lagoutte, Jonathan Narboni
On Vizing's edge colouring question
Journal of Combinatorial Theory, Series B - 2023
Informatique/Mathématique discrète
2023
ART
Konrad Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-Joung Kwon, Sang-Il Oum, Daniël Paulusma
Computing pivot-minors
Computing Research Repository - 2023
Informatique/Mathématique discrète
2022
ART
Loïc Crombez, Guilherme D da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso
Shadoks Approach to Low-Makespan Coordinated Motion Planning
ACM Journal of Experimental Algorithmics - 2022
2022
UNDEFINED
Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud, Yann Vaxès
Isometric path complexity of graphs
Informatique/Mathématique discrète
2022
COMM
Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca
On graphs coverable by k shortest paths
33rd International Symposium on Algorithms and Computation (ISAAC 2022) - 2022
Informatique/Algorithme et structure de données
2022
COMM
Dibyayan Chakraborty, Antoine Dailly, Sandip Das, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh
Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond
33rd International Symposium on Algorithms and Computation (ISAAC 2022) - 2022
Informatique/Algorithme et structure de données
2022
THESE
Alexey Barsukov
On dichotomy above Feder and Vardi's logic
Informatique/Complexité
2022
ART
Bogdan Alecu, Robert Ferguson, Mamadou Moustapha Kanté, Vadim Lozin, Vincent Vatter, Victor Zamaraev
Letter Graphs and Geometric Grid Classes of Permutations
SIAM Journal on Discrete Mathematics - 2022
Informatique/Mathématique discrète
2022
ART
Florent Foucaud, Tuomo Lehtilä
Revisiting and Improving Upper Bounds for Identifying Codes
SIAM Journal on Discrete Mathematics - 2022
Maths
2022
UNDEFINED
Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Galhawat, Dimitri Lajou
Algorithms and complexity for geodetic sets on interval and chordal graphs
Informatique/Mathématique discrète
2022
COMM
Virginia Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond
A lower bound for constant-size local certification
Stabilization, Safety, and Security of Distributed Systems, 24th International Symposium, SSS 2022, Clermont-Ferrand, France - 2022
Informatique/Mathématique discrète
2022
COMM
Arun Kumar Das, Sandip Das, Guilherme D. da Fonseca, Yan Gerard, Bastien Rivier
Complexity Results on Untangling Red-Blue Matchings
LATIN 2022 - 2022
2022
UNDEFINED
Dibyayan Chakraborty, Antoine Dailly, Sandip Das, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh
Complexity and algorithms for Isometric Path Cover on chordal graphs and beyond
Informatique/Algorithme et structure de données
2022
COMM
Fabien Feschet, Jacques-Olivier Lachaud
Full Convexity for Polyhedral Models in Digital Spaces
DGMM 2022 - IAPR Second International Conference on Discrete Geometry and Mathematical Morphology - 2022
Informatique/Imagerie médicale
2022
COMM
Loïc Crombez, Guilherme D da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo
Shadoks Approach to Minimum Partition into Plane Subgraphs
38th International Symposium on Computational Geometry (SoCG 2022) - 2022
2022
COMM
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
The Red-Blue Separation Problem on Graphs
IWOCA 2022 - 2022
Informatique/Algorithme et structure de données
2022
COMM
Eun Jung Kim, O-Joung Kwon, Sang-Il Oum, Mamadou Moustapha Kanté
Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k
STACS 2022 - 2022
Informatique/Mathématique discrète
2022
ART
Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth
SIAM Journal on Discrete Mathematics - 2022
Informatique/Mathématique discrète
2022
UNDEFINED
Arun Kumar Das, Sandip Das, Guilherme D. da Fonseca, Yan Gerard, Bastien Rivier
Complexity Results on Untangling Planar Rectilinear Red-Blue Matchings
Informatique/Géométrie algorithmique
2022
ART
Karima Ennaoui, Khaled Maafa, Lhouari Nourine
Representations for the Largest Extension of a Closure System
Order - 2022
Maths
2022
ART
Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity
Algorithmica - 2022
Informatique/Algorithme et structure de données
2022
COMM
Caroline Brosse, Vincent Limouzy, Arnaud Mary
Polynomial Delay Algorithm for Minimal Chordal Completions
49th International Colloquium on Automata, Languages, and Programming (ICALP) - 2022
2022
ART
Loïc Crombez, Guilherme D da Fonseca, Yan Gerard
Greedy and Local Search Heuristics to Build Area-Optimal Polygons
ACM Journal of Experimental Algorithmics - 2022
Informatique/Géométrie algorithmique
2022
ART
Laurent Beaudou, Florent Foucaud, Reza Naserasr
Smallest $C_{2l+1}$-critical graphs of odd-girth $2k+1$
Discrete Applied Mathematics - 2022
Maths
2022
ART
Jan Dreier, Jakub Gajarsky, Yiting Jiang, Patrice Ossona de Mendez, Jean-Florent Raymond
Twin-width and generalized coloring numbers
Discrete Mathematics - 2022
Informatique/Mathématique discrète
2022
ART
Florent Foucaud, Shih-Shun Kao, Ralf Klasing, Mirka Miller, Joe Ryan
Monitoring the edges of a graph using distances
Discrete Applied Mathematics - 2022
Maths
2022
ART
Florent Foucaud
Problems Related to a Conjecture on Location-Domination in Twin-Free Graphs
Indian Journal of Discrete Mathematics - 2022
Maths
2021
UNDEFINED
Fabien Feschet, Antoine Vacavant, Bertrand Kerautret
Robust reconstructions by multi-scale/irregular tangential covering
Informatique/Imagerie médicale
2021
ART
Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa
Maximal strongly connected cliques in directed graphs: Algorithms and bounds
Discrete Applied Mathematics - 2021
Informatique/Complexité
2021
ART
Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa
Maximal strongly connected cliques in directed graphs: Algorithms and bounds
Discrete Applied Mathematics - 2021
Informatique/Algorithme et structure de données
2021
ART
Oscar Defrain, Lhouari Nourine, Takeaki Uno
On the dualization in distributive lattices and related problems
Discrete Applied Mathematics - 2021
2021
ART
Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora
On the Complexity of Broadcast Domination and Multipacking in Digraphs
Algorithmica - 2021
Informatique/Algorithme et structure de données
2021
ART
Florent Foucaud, Hervé Hocquard, Dimitri Lajou
Complexity and algorithms for injective edge-coloring in graphs
Information Processing Letters - 2021
Informatique/Algorithme et structure de données
2021
COMM
Simon Coumes, Tassadit Bouadi, Lhouari Nourine, Alexandre Termier
Skyline Groups Are Ideals. An Efficient Algorithm for Enumerating Skyline Groups
IWOCA 2021 - 32nd International Workshop on Combinatorial Algorithms - 2021
Informatique/Intelligence artificielle
2021
COMM
Loïc Crombez, Guilherme D da Fonseca, Yan Gérard
Efficient Algorithms for Battleship
10th International Conference on Fun with Algorithms (FUN 2021) - 2021
Informatique/Géométrie algorithmique
2021
PROCEEDINGS
Lhouari Nourine, Simon Vilmin
Enumerating Maximal Consistent Closed Sets in Closure Systems
2021
COMM
Loïc Crombez, Guilherme D. da Fonseca, Yan Gérard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso
Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge)
37th International Symposium on Computational Geometry, SoCG 2021, June 7-11, 2021, Buffalo, NY, USA (Virtual Conference) - 2021
Informatique/Recherche opérationnelle
2021
COMM
Florent Foucaud, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Petru Valicov
Cliques in exact distance powers of graphs of given maximum degree
LAGOS 2021 - 11th Latin and American Algorithms, Graphs and Optimisation Symposium - 2021
Maths
2021
ART
Archontia C Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
A Menger-like property of tree-cut width
Journal of Combinatorial Theory, Series B - 2021
Maths
2021
UNDEFINED
Mohammed Elaroussi, Lhouari Nourine, Mohammed Said Radjef
Lattice point of view for argumentation framework
Informatique/Mathématique discrète
2021
ART
Konrad Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-Joung Kwon, Sang-Il Oum, Daniël Paulusma
Tree pivot-minors and linear rank-width
SIAM Journal on Discrete Mathematics - 2021
Informatique/Mathématique discrète
2021
ART
Ararat Harutyunyan, Lucas Pastor, Stéphan Thomassé
Disproving the normal graph conjecture
Journal of Combinatorial Theory, Series B - 2021
Maths
2021
ART
Benjamin Bergougnoux, Mamadou Moustapha Kanté
More applications of the d-neighbor equivalence: acyclicity and connectivity constraints
SIAM Journal on Discrete Mathematics - 2021
Informatique/Mathématique discrète
2021
COMM
Antoine Vacavant, Bertrand Kerautret, Fabien Feschet
Segment- and Arc-Based Vectorizations by Multi-scale/Irregular Tangential Covering
Geometry and Vision - First International Symposium, ISGV 2021, Auckland, New Zealand, January 28-29, 2021, Revised Selected Papers - 2021
Informatique/Traitement des images
2021
ART
Dimitrios M. Thilikos, Archontia Giannopoulou, Michał Pilipczuk, Jean-Florent Raymond, Marcin Wrochna
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
SIAM Journal on Discrete Mathematics - 2021
Informatique/Mathématique discrète
2021
ART
Konrad Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-Joung Kwon, Sang-Il Oum, Daniël Paulusma
Tree Pivot-Minors and Linear Rank-Width
SIAM Journal on Discrete Mathematics - 2021
Informatique/Mathématique discrète
2021
ART
Jean-Florent Raymond, O-Joung Kwon
Packing and Covering Induced Subdivisions
SIAM Journal on Discrete Mathematics - 2021
Informatique/Mathématique discrète
2021
ART
Florent Foucaud, Narges Ghareghani, Aida Roshany-Tabrizi, Pouyeh Sharifani
Characterizing extremal graphs for open neighbourhood location-domination
Discrete Applied Mathematics - 2021
Maths