default search action
Lucas Picasarri-Arrieta
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Florian Hörsch, Lucas Picasarri-Arrieta:
Complexity Results on the Decomposition of a Digraph into Directed Linear Forests and Out-Stars. Electron. J. Comb. 31(4) (2024) - [j8]Nicolas Nisse, Lucas Picasarri-Arrieta
, Ignasi Sau:
Redicolouring digraphs: Directed treewidth and cycle-degeneracy. Discret. Appl. Math. 356: 191-208 (2024) - [j7]Lucas Picasarri-Arrieta
Minimum number of arcs in k-critical digraphs with order at most 2k - 1. Discret. Math. 347(9): 114072 (2024) - [j6]Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald
Digraph redicolouring. Eur. J. Comb. 116: 103876 (2024) - [j5]Lucas Picasarri-Arrieta, Clément Rambaud:
Subdivisions in dicritical digraphs with large order or digirth. Eur. J. Comb. 122: 104022 (2024) - [j4]Jørgen Bang-Jensen
Constrained flows in networks. Theor. Comput. Sci. 1010: 114702 (2024) - [i11]Lucas Picasarri-Arrieta, Clément Rambaud:
Subdivisions in dicritical digraphs with large order or digirth. CoRR abs/2401.05938 (2024) - [i10]Florian Hörsch, Lucas Picasarri-Arrieta:
Complexity results on the decomposition of a digraph into directed linear forests and out-stars. CoRR abs/2401.09202 (2024) - [i9]Daniel Gonçalves, Lucas Picasarri-Arrieta, Amadeus Reinald:
Brooks-type colourings of digraphs in linear time. CoRR abs/2405.05222 (2024) - [i8]Ken-ichi Kawarabayashi, Lucas Picasarri-Arrieta:
An analogue of Reed's conjecture for digraphs. CoRR abs/2407.05827 (2024) - 2023
- [j3]Stéphane Bessy, Johannes Pardey, Lucas Picasarri-Arrieta, Dieter Rautenbach:
Unbalanced Spanning Subgraphs in Edge Labeled Complete Graphs. Electron. J. Comb. 30(1) (2023) - [c1]Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud:
On the Minimum Number of Arcs in 4-Dicritical Oriented Graphs. WG 2023: 376-387 - [i7]Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald:
Digraph redicolouring. CoRR abs/2301.03417 (2023) - [i6]Lucas Picasarri-Arrieta:
Strengthening the Directed Brooks' Theorem for oriented graphs and consequences on digraph redicolouring. CoRR abs/2301.04881 (2023) - [i5]Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud:
On the minimum number of arcs in 4-dicritical oriented graphs. CoRR abs/2306.10784 (2023) - [i4]Nicolas Nisse, Lucas Picasarri-Arrieta, Ignasi Sau:
Redicolouring digraphs: directed treewidth and cycle-degeneracy. CoRR abs/2307.06700 (2023) - [i3]Stéphane Bessy, Frédéric Havet, Lucas Picasarri-Arrieta:
Dichromatic number of chordal graphs. CoRR abs/2309.17385 (2023) - [i2]Stéphane Bessy, Jørgen Bang-Jensen, Lucas Picasarri-Arrieta:
Constrained Flows in Networks. CoRR abs/2310.01042 (2023) - [i1]Lucas Picasarri-Arrieta, Michael Stiebitz:
Minimum number of arcs in k-critical digraphs with order at most 2k-1. CoRR abs/2310.03584 (2023) - 2022
- [j2]Stéphane Bessy, Johannes Pardey, Lucas Picasarri-Arrieta, Dieter Rautenbach:
Factorially Many Maximum Matchings Close to the Erdős-Gallai Bound. Electron. J. Comb. 29(2) (2022) - [j1]Jørgen Bang-Jensen
Complexity of some arc-partition problems for digraphs. Theor. Comput. Sci. 928: 167-182 (2022)
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-11-08 20:31 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: