E-LIB Suche - Ergebnisse für: Baste, Julien

1

An FPT algorithm for node-disjoint subtrees problems parame..:

Baste, Julien ; Watel, Dimitri
Theoretical Computer Science. 990 (2024) - p. 114406 , 2024

Link: https://doi.org/10.1016/..

2

A Hybrid Genetic Approach for Bi-Level Flexible Job Shops A..:

, In: 2023 IEEE Congress on Evolutionary Computation (CEC),

Juvigny, Corentin ; Baste, Julien ; Lozenguez, Guillaume.. - p. 1-8 , 2023

Link: https://doi.org/10.1109/..

3

Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal ..:

Baste, Julien ; Sau, Ignasi ; Thilikos, Dimitrios M.
SIAM Journal on Computing. 52 (2023) 4 - p. 865-912 , 2023

Link: https://doi.org/10.1137/..

4

Contraction Bidimensionality of Geometric Intersection Grap..:

Baste, Julien ; Thilikos, Dimitrios M.
Algorithmica. 84 (2022) 2 - p. 510-531 , 2022

Link: https://doi.org/10.1007/..

5

Quasi-Clique Mining for Graph Summarization:

, In: Lecture Notes in Computer Science; Database and Expert Systems Applications,

Castillon, Antoine ; Baste, Julien ; Seba, Hamida. - p. 310-315 , 2022

Link: https://doi.org/10.1007/..

6

Towards hybridization of multi-agent simulation and metaheu..:

, In: 2022 IEEE Symposium Series on Computational Intelligence (SSCI),

Juvigny, Corentin ; Baste, Julien ; Lozenguez, Guillaume.. - p. 767-773 , 2022

Link: https://doi.org/10.1109/..

7

Diversity of solutions: An exploration through the lens of ..:

Baste, Julien ; Fellows, Michael R. ; Jaffke, Lars...
Artificial Intelligence. 303 (2022) - p. 103644 , 2022

Link: https://doi.org/10.1016/..

8

Acyclic matchings in graphs of bounded maximum degree:

Baste, Julien ; Fürst, Maximilian ; Rautenbach, Dieter
Discrete Mathematics. 345 (2022) 7 - p. 112885 , 2022

Link: https://doi.org/10.1016/..

9

Bounding and approximating minimum maximal matchings in reg..:

Baste, Julien ; Fürst, Maximilian ; Henning, Michael A...
Discrete Mathematics. 344 (2021) 3 - p. 112243 , 2021

Link: https://doi.org/10.1016/..

10

Minimum Reload Cost Graph Factors:

Baste, Julien ; Gözüpek, Didem ; Shalom, Mordechai.
Theory of Computing Systems. 65 (2021) 5 - p. 815-838 , 2021

Link: https://doi.org/10.1007/..

11

Hitting minors on bounded treewidth graphs. III. Lower boun..:

Baste, Julien ; Sau, Ignasi ; Thilikos, Dimitrios M.
Journal of Computer and System Sciences. 109 (2020) - p. 56-77 , 2020

Link: https://doi.org/10.1016/..

12

A complexity dichotomy for hitting connected minors on boun..:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,

Baste, Julien ; Sau, Ignasi ; Thilikos, Dimitrios M. - p. 951-970 , 2020

Link: https://dl.acm.org/doi/1..

13

Hitting minors on bounded treewidth graphs. II. Single-expo..:

Baste, Julien ; Sau, Ignasi ; Thilikos, Dimitrios M.
Theoretical Computer Science. 814 (2020) - p. 135-152 , 2020

Link: https://doi.org/10.1016/..

14

Linear programming based approximation for unweighted induc..:

Baste, Julien ; Fürst, Maximilian ; Rautenbach, Dieter
Discrete Optimization. 38 (2020) - p. 100593 , 2020

Link: https://doi.org/10.1016/..

15

Domination versus edge domination:

Baste, Julien ; Fürst, Maximilian ; Henning, Michael A...
Discrete Applied Mathematics. 285 (2020) - p. 343-349 , 2020

Link: https://doi.org/10.1016/..