default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorian Barbero
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j6]Florian Barbero, Lucas Isenmann
, Jocelyn Thiebaut:
On the Distance Identifying Set Meta-problem and Applications to the Complexity of Identifying Problems on Graphs. Algorithmica 82(8): 2243-2266 (2020)- [j5]Florian Barbero, Guilhem Gamard, Anaël Grandjean:
Quasiperiods of biinfinite words. Eur. J. Comb. 85 (2020) - 2019
- [j4]Florian Barbero, Christophe Paul, Michal Pilipczuk:
Strong immersion is a well-quasi-ordering for semicomplete digraphs. J. Graph Theory 90(4): 484-496 (2019) - 2018
- [j3]Florian Barbero, Christophe Paul, Michal Pilipczuk:
Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs. ACM Trans. Algorithms 14(3): 38:1-38:31 (2018) - 2017
- [j2]Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized and Approximation Algorithms for the Load Coloring Problem. Algorithmica 79(1): 211-229 (2017) - 2016
- [j1]Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng, Anders Yeo:
Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths. Inf. Process. Lett. 116(6): 433-436 (2016)
Conference and Workshop Papers
- 2018
- [c3]Florian Barbero, Lucas Isenmann, Jocelyn Thiebaut:
On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs. IPEC 2018: 10:1-10:14 - 2017
- [c2]Florian Barbero, Christophe Paul, Michal Pilipczuk:
Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs. ICALP 2017: 70:1-70:13 - 2015
- [c1]Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized and Approximation Algorithms for the Load Coloring Problem. IPEC 2015: 43-54
Informal and Other Publications
- 2018
- [i6]Florian Barbero, Guilhem Gamard, Anaël Grandjean:
Quasiperiods of biinfinite Sturmian words. CoRR abs/1803.02643 (2018) - [i5]Florian Barbero, Lucas Isenmann, Jocelyn Thiebaut:
On the Distance Identifying Set meta-problem and applications to the complexity of identifying problems on graphs. CoRR abs/1810.03868 (2018) - 2017
- [i4]Florian Barbero, Christophe Paul, Michal Pilipczuk:
Exploring the complexity of layout parameters in tournaments and semi-complete digraphs. CoRR abs/1706.00617 (2017) - [i3]Florian Barbero, Christophe Paul, Michal Pilipczuk:
Strong immersion is a well-quasi-ordering for semi-complete digraphs. CoRR abs/1707.03563 (2017) - 2015
- [i2]Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng, Anders Yeo:
Linear-Vertex Kernel for the Problem of Packing r-Stars into a Graph without Long Induced Paths. CoRR abs/1510.03564 (2015) - 2014
- [i1]Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized and Approximation Algorithms for the Load Coloring Problem. CoRR abs/1412.3023 (2014)
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-04-24 23:21 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:
