Filtrer vos résultats
- 21
- 19
- 20
- 9
- 8
- 2
- 1
- 1
- 37
- 3
- 1
- 1
- 2
- 3
- 1
- 1
- 1
- 3
- 1
- 3
- 2
- 3
- 4
- 7
- 1
- 3
- 1
- 1
- 1
- 39
- 1
- 18
- 13
- 10
- 8
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 40
- 17
- 7
- 6
- 6
- 5
- 5
- 3
- 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
40 résultats
|
|
|
triés par
|
|
|
Competitive Graph SearchesRR-07017, 2007
Rapport
lirmm-00132103v3
|
||
Representing Partitive Crossing Families and Union-Difference Families, with Application to Sesquimodular DecompositionRR-07031, 2007
Rapport
lirmm-00199916v1
|
|||
|
|
Temporal MatchingTheoretical Computer Science, 2020, ⟨10.1016/j.tcs.2019.03.026⟩
Article dans une revue
hal-02075865v1
|
||
Feedback vertex set on graphs of low cliquewidth20th International Workshop on Combinatorial Algorithms (IWOCA'09), 2009, Hradec nad Moravicí, Czech Republic. pp.113-124
Communication dans un congrès
hal-00555473v1
|
|||
Boolean-width of graphsTheoretical Computer Science, 2011, 412 (39), pp.5187--5204
Article dans une revue
hal-00640644v1
|
|||
|
|
Unifying two Graph Decompositions with Modular DecompositionInternational Symposium on Algorithms and Computation (ISAAC, Dec 2007, Sendai, Japan. pp.52-64, ⟨10.1007/978-3-540-77120-3⟩
Communication dans un congrès
hal-00022957v3
|
||
|
|
A new tractable combinatorial decompositionRR-07016, 2007
Rapport
lirmm-00157502v2
|
||
|
|
A Representation Theorem for Union-Difference Families and ApplicationLATIN: Latin American Symposium, Apr 2008, Búzios, Brazil. pp.492-503, ⟨10.1007/978-3-540-78773-0_43⟩
Communication dans un congrès
lirmm-00324969v1
|
||
|
|
Unifying Two Graph Decompositions with Modular DecompositionISAAC'07: 18th International Symposium on Algorithms and Computation, Dec 2007, Sendai, Japan. pp.52-64, ⟨10.1007/978-3-540-77120-3_7⟩
Communication dans un congrès
lirmm-00325376v1
|
||
|
|
Intersection graphs of almost subnormal subgroups in general skew linear groups2020
Pré-publication, Document de travail
hal-02997959v1
|
||
Feedback vertex set on graphs of low cliquewidthEuropean Journal of Combinatorics, 2013, 34 (3), pp.666-679
Article dans une revue
hal-00640643v1
|
|||
Boolean-width of graphs4th International Workshop on Parameterized and Exact Computation (IWPEC'09), 2009, Copenhagen, Denmark. pp.61-74
Communication dans un congrès
hal-00555494v1
|
|||
|
|
H-join decomposable graphs and algorithms with runtime single exponential in rankwidthDiscrete Applied Mathematics, 2010, 158 (7), pp.809-819. ⟨10.1016/j.dam.2009.09.009⟩
Article dans une revue
hal-00555511v1
|
||
|
|
Computing shortest, fastest, and foremost journeys in dynamic networksRR-4589, INRIA. 2002
Rapport
inria-00071996v1
|
||
|
|
Tree-representation of set families and applications to combinatorial decompositionsEuropean Journal of Combinatorics, 2012, 33 (5), pp.688-711. ⟨10.1016/j.ejc.2011.09.032⟩
Article dans une revue
hal-00555520v1
|
||
|
|
Marche sans escale dans un graphe temporelAlgoTel 2023 - 25èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2023, Cargese, France
Communication dans un congrès
hal-04088181v1
|
||
|
|
On the boolean-width of a graph: structure and applications36th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'10), Jun 2010, Zarós, Crete, Greece. pp.159-170, ⟨10.1007/978-3-642-16926-7_16⟩
Communication dans un congrès
hal-00555502v1
|
||
Revisiting Uno and Yagiura's AlgorithmsISAAC'05: 16th Annual Symposium on Algorithms and Computation, 2005
Communication dans un congrès
lirmm-00106037v1
|
|||
|
|
Divide and Conquer Revisited. Application to Graph Algorithms04027, 2004, pp.14
Rapport
lirmm-00109200v1
|
||
How modular structure can simplify tasks on networks: parameterizing graph optimization by fast local community detectionProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2014, 470 (2170), pp.20140224
Article dans une revue
hal-01146176v1
|
|||
|
|
Forte ∆-connexité dans les flots de liensALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2016, Bayonne, France
Communication dans un congrès
hal-01305128v1
|
||
|
|
Competitive Graph SearchesTheoretical Computer Science, 2008, 393 (1-3), pp.72-80. ⟨10.1016/j.tcs.2007.10.048⟩
Article dans une revue
lirmm-00324565v1
|
||
|
|
Foremost non-stop journey arrival in linear timeSIROCCO 2022 - 29th International Colloquium on Structural Information and Communication Complexity, Jun 2022, Paderborn, Germany. pp.283-301, ⟨10.1007/978-3-031-09993-9_16⟩
Communication dans un congrès
hal-03856717v1
|
||
From Permutations to Graph Algorithms05021, 2005, pp.14
Rapport
lirmm-00106625v1
|
|||
|
|
Algorithmic Aspects of a General Modular Decomposition Theory2007
Pré-publication, Document de travail
hal-00111235v2
|
||
|
|
Temporal matching in link stream: kernel and approximationCTW 2018 - 16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Jun 2018, Paris, France
Communication dans un congrès
hal-02075831v1
|
||
Representation theorems for two set families and applications to combinatorial decompositionsInternational Conference on Relations, Orders and Graphs: Interaction with Computer Science (ROGICS'08), 2008, Mahdia, Tunisia. pp.532-546
Communication dans un congrès
hal-00555315v1
|
|||
A generic approach to decomposition algorithms, with an application to digraph decompositionThe 17th Annual International Computing and Combinatorics Conference (COCOON'11), Aug 2011, Dallas, TX, United States. pp.331--342, ⟨10.1007/978-3-642-22685-4_30⟩
Communication dans un congrès
istex
hal-00640645v1
|
|||
|
|
Computing Temporal Twins in Time Logarithmic in History LengthComplex Networks 2020, Dec 2020, Madrid, Spain
Communication dans un congrès
hal-02997890v1
|
||
|
|
Evolving graphs and least cost journeys in dynamic networksWiOpt'03: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, Mar 2003, Sophia Antipolis, France. 10 p
Communication dans un congrès
inria-00466676v1
|
- 1
- 2