Julien Baste - RankMe

67 papers A* 2A 1B 9C 1Misc 1Journal 50Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	A Polynomial Bound on the Pathwidth of Graphs Edge-Coverable by k Shortest Paths. STACS Julien Baste, Lucas de Meyer, Ugo Giocanti, Étienne Objois, Timothé Picavet
2026	J	`jnl`	Impact of diversity on bounded archives for multi-objective local search. CoRR Amadeu Almeida Coco, Cyprien Borée, Julien Baste, Laetitia Jourdan, Lucien Mousin
2025	J	`jnl`	A polynomial bound on the pathwidth of graphs edge-coverable by CoRR Julien Baste, Lucas de Meyer, Ugo Giocanti, Étienne Objois, Timothé Picavet
2024	J	`jnl`	An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth. Theor. Comput. Sci. Julien Baste, Dimitri Watel
2024	J	`jnl`	Composing dynamic programming tree-decomposition-based algorithms. Discret. Math. Theor. Comput. Sci. Julien Baste
2024	J	`jnl`	Neighborhood-Preserving Graph Sparsification. Proc. VLDB Endow. Abd Errahmane Kiouche, Julien Baste, Mohammed Haddad, Hamida Seba, Angela Bonifati
2024	J	`jnl`	γ-clustering problems: Classical and parametrized complexity. Theor. Comput. Sci. Julien Baste, Antoine Castillon, Clarisse Dhaenens, Mohammed Haddad, Hamida Seba
2023	B	`conf`	A Hybrid Genetic Approach for Bi-Level Flexible Job Shops Arising from Selective Deconstruction. CEC Corentin Juvigny, Julien Baste, Guillaume Lozenguez, Arnaud Doniec, Laetitia Jourdan
2023	J	`jnl`	Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm. SIAM J. Comput. Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2023	J	`jnl`	The Leafed Induced Subtree in chordal and bounded treewidth graphs. CoRR Julien Baste
2022	J	`jnl`	Acyclic matchings in graphs of bounded maximum degree. Discret. Math. Julien Baste, Maximilian Fürst, Dieter Rautenbach
2022	J	`jnl`	Contraction Bidimensionality of Geometric Intersection Graphs. Algorithmica Julien Baste, Dimitrios M. Thilikos
2022	J	`jnl`	Contraction Bidimensionality of Geometric Intersection Graphs. CoRR Julien Baste, Dimitrios M. Thilikos
2022	J	`jnl`	Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. Artif. Intell. Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
2022	J	`jnl`	Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree. Discret. Math. Theor. Comput. Sci. Julien Baste, Stefan Ehard, Dieter Rautenbach
2022	—	`conf`	Quasi-Clique Mining for Graph Summarization. DEXA (2) Antoine Castillon, Julien Baste, Hamida Seba, Mohammed Haddad
2022	—	`conf`	Towards hybridization of multi-agent simulation and metaheuristics applied to selective deconstruction. SSCI Corentin Juvigny, Julien Baste, Guillaume Lozenguez, Arnaud Doniec, Laetitia Jourdan
2021	J	`jnl`	A Neighborhood-preserving Graph Summarization. CoRR Abd Errahmane Kiouche, Julien Baste, Mohammed Haddad, Hamida Seba
2021	J	`jnl`	Bounding and approximating minimum maximal matchings in regular graphs. Discret. Math. Julien Baste, Maximilian Fürst, Michael A. Henning, Elena Mohr, Dieter Rautenbach
2021	J	`jnl`	Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. CoRR Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2021	J	`jnl`	Hitting minors on bounded treewidth graphs. III. Lower bounds. CoRR Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2021	J	`jnl`	Minimum Reload Cost Graph Factors. Theory Comput. Syst. Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos
2020	A*	`conf`	A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary. SODA Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2020	Misc	`conf`	Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies. COCOON Julien Baste, Maximilian Fürst, Dieter Rautenbach
2020	A*	`conf`	Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory. IJCAI Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
2020	J	`jnl`	Domination versus edge domination. Discret. Appl. Math. Julien Baste, Maximilian Fürst, Michael A. Henning, Elena Mohr, Dieter Rautenbach
2020	J	`jnl`	Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds. SIAM J. Discret. Math. Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2020	J	`jnl`	Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. Theor. Comput. Sci. Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2020	J	`jnl`	Hitting minors on bounded treewidth graphs. III. Lower bounds. J. Comput. Syst. Sci. Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2020	J	`jnl`	Linear programming based approximation for unweighted induced matchings - Breaking the Δ barrier. Discret. Optim. Julien Baste, Maximilian Fürst, Dieter Rautenbach
2020	J	`jnl`	Non-monotone target sets for threshold values restricted to 0, 1, and the vertex degree. CoRR Julien Baste, Stefan Ehard, Dieter Rautenbach
2020	J	`jnl`	Parameterized complexity of finding a spanning tree with minimum reload cost diameter. Networks Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
2020	J	`jnl`	Temporal matching. Theor. Comput. Sci. Julien Baste, Binh-Minh Bui-Xuan, Antoine Roux
2019	J	`jnl`	Approximating maximum uniquely restricted matchings in bipartite graphs. Discret. Appl. Math. Julien Baste, Dieter Rautenbach, Ignasi Sau
2019	J	`jnl`	Composing dynamic programming tree-decomposition-based algorithms. CoRR Julien Baste
2019	J	`jnl`	Diversity in Combinatorial Optimization. CoRR Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
2019	J	`jnl`	FPT Algorithms for Diverse Collections of Hitting Sets. Algorithms Julien Baste, Lars Jaffke, Tomás Masarík, Geevarghese Philip, Günter Rote
2019	J	`jnl`	FPT Algorithms for Diverse Collections of Hitting Sets. CoRR Julien Baste, Lars Jaffke, Tomás Masarík, Geevarghese Philip, Günter Rote
2019	J	`jnl`	Hitting minors on bounded treewidth graphs. IV. An optimal algorithm. CoRR Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2019	B	`conf`	Minimum Reload Cost Graph Factors. SOFSEM Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos
2019	J	`jnl`	Upper bounds on the uniquely restricted chromatic index. J. Graph Theory Julien Baste, Dieter Rautenbach, Ignasi Sau
2018	B	`conf`	A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth. IPEC Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2018	J	`jnl`	Degenerate matchings and edge colorings. Discret. Appl. Math. Julien Baste, Dieter Rautenbach
2018	J	`jnl`	Minimum Reload Cost Graph Factors. CoRR Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos
2018	J	`jnl`	On the number of labeled graphs of bounded treewidth. Eur. J. Comb. Julien Baste, Marc Noy, Ignasi Sau
2018	J	`jnl`	Ruling out FPT algorithms for Weighted Coloring on forests. Theor. Comput. Sci. Júlio Araújo, Julien Baste, Ignasi Sau
2018	J	`jnl`	Temporal Matching. CoRR Julien Baste, Binh-Minh Bui-Xuan, Antoine Roux
2017	B	`conf`	Contraction-Bidimensionality of Geometric Intersection Graphs. IPEC Julien Baste, Dimitrios M. Thilikos
2017	J	`jnl`	Hitting minors on bounded treewidth graphs. I. General upper bounds. CoRR Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2017	B	`conf`	On the Number of Labeled Graphs of Bounded Treewidth. WG Julien Baste, Marc Noy, Ignasi Sau
2017	J	`jnl`	On the parameterized complexity of the Edge Monitoring problem. Inf. Process. Lett. Julien Baste, Fairouz Beggas, Hamamache Kheddouci, Ignasi Sau
2017	B	`conf`	Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth. IPEC Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2017	J	`jnl`	Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion. Theory Comput. Syst. Julien Baste, Luérbio Faria, Sulamita Klein, Ignasi Sau
2017	B	`conf`	Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter. IPEC Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
2017	J	`jnl`	Parameterized complexity of finding a spanning tree with minimum reload cost diameter. CoRR Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
2017	J	`jnl`	Ruling out FPT algorithms for Weighted Coloring on forests. CoRR Júlio Araújo, Julien Baste, Ignasi Sau
2017	J	`jnl`	Ruling out FPT algorithms for Weighted Coloring on forests. Electron. Notes Discret. Math. Júlio Araújo, Julien Baste, Ignasi Sau
2017	—	`—`	Treewidth: algorithmic, combinatorial, and practical aspects. (Treewidth: aspects algorithmiques, combinatoires et pratiques). Julien Baste
2017	B	`conf`	Uniquely Restricted Matchings and Edge Colorings. WG Julien Baste, Dieter Rautenbach, Ignasi Sau
2016	C	`conf`	Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees. AAIM Julien Baste, Christophe Paul, Ignasi Sau, Céline Scornavacca
2016	J	`jnl`	Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. CoRR Julien Baste, Christophe Paul, Ignasi Sau, Céline Scornavacca
2016	J	`jnl`	The number of labeled graphs of bounded treewidth. CoRR Julien Baste, Marc Noy, Ignasi Sau
2016	J	`jnl`	Uniquely restricted matchings and edge colorings. CoRR Julien Baste, Dieter Rautenbach, Ignasi Sau
2015	J	`jnl`	Parameterized complexity dichotomy for (r, ℓ)-Vertex Deletion. CoRR Julien Baste, Luérbio Faria, Sulamita Klein, Ignasi Sau
2015	J	`jnl`	The role of planarity in connectivity problems parameterized by treewidth. Theor. Comput. Sci. Julien Baste, Ignasi Sau
2014	B	`conf`	The Role of Planarity in Connectivity Problems Parameterized by Treewidth. IPEC Julien Baste, Ignasi Sau
2013	J	`jnl`	The role of planarity in connectivity problems parameterized by treewidth. CoRR Julien Baste, Ignasi Sau