default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrançois Dross
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j25]François Dross, Claire Hilaire, Ivo Koch, Valeria Leoni, Nina Pardal
, Maria Inés Lopez Pujato, Vinícius Fernandes dos Santos:
On the proper interval completion problem within some chordal subclasses. Discret. Math. 348(1): 114274 (2025)- 2023
- [j24]Stephan Dominique Andres, François Dross, Melissa A. Huggan, Fionn Mc Inerney, Richard J. Nowakowski:
The Complexity of Two Colouring Games. Algorithmica 85(4): 1067-1090 (2023) - [c5]François Dross, Krzysztof Fleszar, Karol Wegrzycki, Anna Zych-Pawlewicz:
Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours. SODA 2023: 1433-1463 - [i20]Marthe Bonamy, Fábio Botler, François Dross, Tássio Naia, Jozef Skokan:
Separating the edges of a graph by a linear number of paths. CoRR abs/2301.08707 (2023) - [i19]Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma:
Computing pivot-minors. CoRR abs/2311.04656 (2023) - 2022
- [j23]Julien Bensmail, François Dross, Nacim Oijid, Éric Sopena:
Generalising the achromatic number to Zaslavsky's colourings of signed graphs. Theor. Comput. Sci. 923: 196-221 (2022) - [i18]François Dross, Krzysztof Fleszar, Karol Wegrzycki, Anna Zych-Pawlewicz:
Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours. CoRR abs/2209.08904 (2022) - 2021
- [j22]Marthe Bonamy, François Dross, Tomás Masarík, Andrea Munaro, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk:
Jones' Conjecture in Subcubic Graphs. Electron. J. Comb. 28(4) (2021) - [j21]Nemanja Draganic, François Dross, Jacob Fox, António Girão, Frédéric Havet, Dániel Korándi, William Lochet, David Munhá Correia, Alex D. Scott, Benny Sudakov:
Powers of paths in tournaments. Comb. Probab. Comput. 30(6): 894-898 (2021) - [j20]François Dross, Frédéric Havet:
On the unavoidability of oriented trees. J. Comb. Theory B 151: 83-110 (2021) - [j19]Konrad K. 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 J. Discret. Math. 35(4): 2922-2945 (2021) - [i17]Julien Bensmail, François Dross, Nacim Oijid, Éric Sopena:
Generalising the achromatic number to Zaslavsky's colourings of signed graphs. CoRR abs/2109.13627 (2021) - [i16]François Dross, Claire Hilaire, Ivo Koch, Valeria Leoni, Nina Pardal, Maria Inés Lopez Pujato, Vinícius Fernandes dos Santos:
On the proper interval completion problem within some chordal subclasses. CoRR abs/2110.07706 (2021) - 2020
- [j18]Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski:
Maximal Wiener index for graphs with prescribed number of blocks. Appl. Math. Comput. 380: 125274 (2020) - [j17]François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron:
Complexity of planar signed graph homomorphisms to cycles. Discret. Appl. Math. 284: 166-178 (2020) - [j16]Stéphane Bessy, François Dross, Martin Knor, Riste Skrekovski:
Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs. Discret. Appl. Math. 284: 195-200 (2020) - [j15]Ilkyoo Choi, François Dross, Pascal Ochem:
Partitioning sparse graphs into an independent set and a graph with bounded size components. Discret. Math. 343(8): 111921 (2020) - [j14]Julien Bensmail, François Dross, Hervé Hocquard, Éric Sopena:
From light edges to strong edge-colouring of 1-planar graphs. Discret. Math. Theor. Comput. Sci. 22(1) (2020) - [j13]Julien Bensmail, François Dross, Nicolas Nisse:
Decomposing Degenerate Graphs into Locally Irregular Subgraphs. Graphs Comb. 36(6): 1869-1889 (2020) - [j12]Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski:
The structure of graphs with given number of blocks and the maximum Wiener index. J. Comb. Optim. 39(1): 170-184 (2020) - [i15]Konrad K. 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. CoRR abs/2008.00561 (2020)
2010 – 2019
- 2019
- [j11]François Dross, Mickaël Montassier, Alexandre Pinlou:
Large induced forests in planar graphs with girth 4. Discret. Appl. Math. 254: 96-106 (2019) - [j10]François Dross, Mickaël Montassier, Alexandre Pinlou:
A lower bound on the order of the largest induced linear forest in triangle-free planar graphs. Discret. Math. 342(4): 943-950 (2019) - [j9]François Dross, Borut Luzar, Mária Maceková, Roman Soták:
Note on 3-choosability of planar graphs with maximum degree 4. Discret. Math. 342(11): 3123-3129 (2019) - [j8]François Dross, Pascal Ochem:
Vertex partitions of (C3, C4, C6)-free planar graphs. Discret. Math. 342(11): 3229-3236 (2019) - [j7]Konrad K. Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma:
Filling the complexity gaps for colouring planar and bounded degree graphs. J. Graph Theory 92(4): 377-393 (2019) - [c4]François Dross, Frédéric Havet:
On the Unavoidability of Oriented Trees. LAGOS 2019: 425-436 - [i14]Ilkyoo Choi, François Dross, Pascal Ochem:
Partitioning sparse graphs into an independent set and a graph with bounded size components. CoRR abs/1905.02123 (2019) - [i13]Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski:
The structure of graphs with given number of blocks and the maximum Wiener index. CoRR abs/1905.02633 (2019) - [i12]Stéphane Bessy, François Dross, Martin Knor, Riste Skrekovski:
Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs. CoRR abs/1905.04291 (2019) - [i11]François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron:
Complexity of planar signed graph homomorphisms to cycles. CoRR abs/1907.03266 (2019) - [i10]Marthe Bonamy, François Dross, Tomás Masarík, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk:
Jones' Conjecture in subcubic graphs. CoRR abs/1912.01570 (2019) - 2018
- [b1]François Dross:
Vertex partition of sparse graphs. (Partition des sommets de graphes peu denses). University of Montpellier, France, 2018 - [j6]François Dross, Mickaël Montassier, Alexandre Pinlou:
Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded Degree. Electron. J. Comb. 25(1): 1 (2018) - [c3]Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma:
Computing Small Pivot-Minors. WG 2018: 125-138 - [i9]François Dross, Frédéric Havet:
On the unavoidability of oriented trees. CoRR abs/1812.05167 (2018) - 2017
- [j5]François Dross, Mickaël Montassier, Alexandre Pinlou:
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. Eur. J. Comb. 66: 81-94 (2017) - [j4]Konrad K. Dabrowski, François Dross, Daniël Paulusma:
Colouring diamond-free graphs. J. Comput. Syst. Sci. 89: 410-431 (2017) - [i8]François Dross, Mickaël Montassier, Alexandre Pinlou:
A lower bound on the order of the largest induced linear forest in triangle-free planar graphs. CoRR abs/1705.11133 (2017) - [i7]François Dross, Pascal Ochem:
Vertex partitions of (C3, C4, C6)-free planar graphs. CoRR abs/1711.08710 (2017) - 2016
- [j3]François Dross, Mickaël Montassier, Alexandre Pinlou:
A lower bound on the order of the largest induced forest in planar graphs with high girth. Discret. Appl. Math. 214: 99-107 (2016) - [j2]François Dross:
Fractional Triangle Decompositions in Graphs with Large Minimum Degree. SIAM J. Discret. Math. 30(1): 36-42 (2016) - [c2]Konrad K. Dabrowski, François Dross, Daniël Paulusma:
Colouring Diamond-free Graphs. SWAT 2016: 16:1-16:14 - [i6]François Dross, Mickaël Montassier, Alexandre Pinlou:
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. CoRR abs/1601.01523 (2016) - [i5]François Dross, Mickaël Montassier, Alexandre Pinlou:
Partitioning sparse graphs into an independent set and a forest of bounded degree. CoRR abs/1606.04394 (2016) - 2015
- [j1]François Dross, Mickaël Montassier, Alexandre Pinlou:
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. Electron. Notes Discret. Math. 49: 269-275 (2015) - [c1]Konrad Kazimierz Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma:
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs. IWOCA 2015: 100-111 - [i4]François Dross, Mickaël Montassier, Alexandre Pinlou:
A lower bound on the order of the largest induced forest in planar graphs with high girth. CoRR abs/1504.01949 (2015) - [i3]Konrad Kazimierz Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma:
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs. CoRR abs/1506.06564 (2015) - [i2]Konrad Kazimierz Dabrowski, François Dross, Daniël Paulusma:
Narrowing the gap in the clique-width dichotomy for $(H_1, H_2)$-free graphs. CoRR abs/1512.07849 (2015) - 2014
- [i1]François Dross, Mickaël Montassier, Alexandre Pinlou:
Large induced forests in planar graphs with girth 4 or 5. CoRR abs/1409.1348 (2014)
Coauthor Index
aka: Konrad Kazimierz Dabrowski
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-11-07 21:34 CET 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:
