default search action
Julien Baste
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j26]Julien Baste, Dimitri Watel:
An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth. Theor. Comput. Sci. 990: 114406 (2024) - [j25]Julien Baste, Antoine Castillon, Clarisse Dhaenens, Mohammed Haddad, Hamida Seba:
γ-clustering problems: Classical and parametrized complexity. Theor. Comput. Sci. 1018: 114784 (2024) - 2023
- [j24]Julien Baste
, Ignasi Sau
Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm. SIAM J. Comput. 52(4): 865-912 (2023) - [c15]Corentin Juvigny
A Hybrid Genetic Approach for Bi-Level Flexible Job Shops Arising from Selective Deconstruction. CEC 2023: 1-8 - [i20]Julien Baste:
The Leafed Induced Subtree in chordal and bounded treewidth graphs. CoRR abs/2301.12783 (2023) - 2022
- [j23]Julien Baste
Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. Artif. Intell. 303: 103644 (2022) - [j22]Julien Baste
Contraction Bidimensionality of Geometric Intersection Graphs. Algorithmica 84(2): 510-531 (2022) - [j21]Julien Baste, Maximilian Fürst, Dieter Rautenbach:
Acyclic matchings in graphs of bounded maximum degree. Discret. Math. 345(7): 112885 (2022) - [j20]Julien Baste, Stefan Ehard, Dieter Rautenbach:
Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - [c14]Antoine Castillon, Julien Baste, Hamida Seba, Mohammed Haddad
Quasi-Clique Mining for Graph Summarization. DEXA (2) 2022: 310-315 - [c13]Corentin Juvigny, Julien Baste
Towards hybridization of multi-agent simulation and metaheuristics applied to selective deconstruction. SSCI 2022: 767-773 - [i19]Julien Baste, Dimitrios M. Thilikos:
Contraction Bidimensionality of Geometric Intersection Graphs. CoRR abs/2207.09751 (2022) - 2021
- [j19]Julien Baste
Bounding and approximating minimum maximal matchings in regular graphs. Discret. Math. 344(3): 112243 (2021) - [j18]Julien Baste
Minimum Reload Cost Graph Factors. Theory Comput. Syst. 65(5): 815-838 (2021) - [i18]Abd Errahmane Kiouche, Julien Baste, Mohammed Haddad, Hamida Seba:
A Neighborhood-preserving Graph Summarization. CoRR abs/2101.11559 (2021) - [i17]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. CoRR abs/2103.06536 (2021) - [i16]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting minors on bounded treewidth graphs. III. Lower bounds. CoRR abs/2103.06614 (2021) - 2020
- [j17]Julien Baste
Domination versus edge domination. Discret. Appl. Math. 285: 343-349 (2020) - [j16]Julien Baste
Linear programming based approximation for unweighted induced matchings - Breaking the Δ barrier. Discret. Optim. 38: 100593 (2020) - [j15]Julien Baste
Hitting minors on bounded treewidth graphs. III. Lower bounds. J. Comput. Syst. Sci. 109: 56-77 (2020) - [j14]Julien Baste
Parameterized complexity of finding a spanning tree with minimum reload cost diameter. Networks 75(3): 259-277 (2020) - [j13]Julien Baste
Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds. SIAM J. Discret. Math. 34(3): 1623-1648 (2020) - [j12]Julien Baste
Temporal matching. Theor. Comput. Sci. 806: 184-196 (2020) - [j11]Julien Baste
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. Theor. Comput. Sci. 814: 135-152 (2020) - [c12]Julien Baste
Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies. COCOON 2020: 542-553 - [c11]Julien Baste
Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory. IJCAI 2020: 1119-1125 - [c10]Julien Baste
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary. SODA 2020: 951-970 - [i15]Julien Baste, Stefan Ehard, Dieter Rautenbach:
Non-monotone target sets for threshold values restricted to 0, 1, and the vertex degree. CoRR abs/2007.03959 (2020)
2010 – 2019
- 2019
- [j10]Julien Baste
FPT Algorithms for Diverse Collections of Hitting Sets. Algorithms 12(12): 254 (2019) - [j9]Julien Baste
Approximating maximum uniquely restricted matchings in bipartite graphs. Discret. Appl. Math. 267: 30-40 (2019) - [j8]Julien Baste
Upper bounds on the uniquely restricted chromatic index. J. Graph Theory 91(3): 251-258 (2019) - [c9]Julien Baste
Minimum Reload Cost Graph Factors. SOFSEM 2019: 67-80 - [i14]Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík
Diversity in Combinatorial Optimization. CoRR abs/1903.07410 (2019) - [i13]Julien Baste:
Composing dynamic programming tree-decomposition-based algorithms. CoRR abs/1904.12500 (2019) - [i12]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting minors on bounded treewidth graphs. IV. An optimal algorithm. CoRR abs/1907.04442 (2019) - [i11]Julien Baste, Lars Jaffke, Tomás Masarík
FPT Algorithms for Diverse Collections of Hitting Sets. CoRR abs/1911.05032 (2019) - 2018
- [j7]Julien Baste
Degenerate matchings and edge colorings. Discret. Appl. Math. 239: 38-44 (2018) - [j6]Julien Baste
On the number of labeled graphs of bounded treewidth. Eur. J. Comb. 71: 12-21 (2018) - [j5]Júlio Araújo
Ruling out FPT algorithms for Weighted Coloring on forests. Theor. Comput. Sci. 729: 11-19 (2018) - [c8]Julien Baste
A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth. IPEC 2018: 2:1-2:13 - [i10]Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos:
Minimum Reload Cost Graph Factors. CoRR abs/1810.11700 (2018) - [i9]Julien Baste, Binh-Minh Bui-Xuan, Antoine Roux:
Temporal Matching. CoRR abs/1812.08615 (2018) - 2017
- [b1]Julien Baste:
Treewidth: algorithmic, combinatorial, and practical aspects. (Treewidth: aspects algorithmiques, combinatoires et pratiques). University of Montpellier, France, 2017 - [j4]Júlio Araújo
Ruling out FPT algorithms for Weighted Coloring on forests. Electron. Notes Discret. Math. 62: 195-200 (2017) - [j3]Julien Baste
On the parameterized complexity of the Edge Monitoring problem. Inf. Process. Lett. 121: 39-44 (2017) - [j2]Julien Baste
Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion. Theory Comput. Syst. 61(3): 777-794 (2017) - [c7]Julien Baste
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter. IPEC 2017: 3:1-3:12 - [c6]Julien Baste
Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth. IPEC 2017: 4:1-4:12 - [c5]Julien Baste
Contraction-Bidimensionality of Geometric Intersection Graphs. IPEC 2017: 5:1-5:13 - [c4]Julien Baste
On the Number of Labeled Graphs of Bounded Treewidth. WG 2017: 88-99 - [c3]Julien Baste
Uniquely Restricted Matchings and Edge Colorings. WG 2017: 100-112 - [i8]Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau
Parameterized complexity of finding a spanning tree with minimum reload cost diameter. CoRR abs/1703.01686 (2017) - [i7]Júlio Araújo, Julien Baste, Ignasi Sau
Ruling out FPT algorithms for Weighted Coloring on forests. CoRR abs/1703.09726 (2017) - [i6]Julien Baste, Ignasi Sau
Hitting minors on bounded treewidth graphs. I. General upper bounds. CoRR abs/1704.07284 (2017) - 2016
- [c2]Julien Baste
Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees. AAIM 2016: 53-64 - [i5]Julien Baste, Christophe Paul, Ignasi Sau
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. CoRR abs/1604.03008 (2016) - [i4]Julien Baste, Marc Noy, Ignasi Sau
The number of labeled graphs of bounded treewidth. CoRR abs/1604.07273 (2016) - [i3]Julien Baste, Dieter Rautenbach, Ignasi Sau:
Uniquely restricted matchings and edge colorings. CoRR abs/1611.06815 (2016) - 2015
- [j1]Julien Baste
The role of planarity in connectivity problems parameterized by treewidth. Theor. Comput. Sci. 570: 1-14 (2015) - [i2]Julien Baste, Luérbio Faria, Sulamita Klein, Ignasi Sau
Parameterized complexity dichotomy for (r, ℓ)-Vertex Deletion. CoRR abs/1504.05515 (2015) - 2014
- [c1]Julien Baste
The Role of Planarity in Connectivity Problems Parameterized by Treewidth. IPEC 2014: 63-74 - 2013
- [i1]Julien Baste, Ignasi Sau:
The role of planarity in connectivity problems parameterized by treewidth. CoRR abs/1312.2889 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-11 00:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: