default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLoïc Crombez
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2021
[b1]Loïc Crombez:
Finding Digital convexity. (Le monde de la Convexité DiscrèTE). University of Clermont Auvergne, Clermont-Ferrand, France, 2021
Journal Articles
- 2023
- [j4]Loïc Crombez, Guilherme Dias da Fonseca, Florian Fontan, Yan Gerard, Aldo Gonzalez-Lorenzo
, Pascal Lafourcade, Luc Libralesso, Benjamin Momège, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng:
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring. ACM J. Exp. Algorithmics 28: 1.2:1-1.2:13 (2023) - 2022
- [j3]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard:
Greedy and Local Search Heuristics to Build Area-Optimal Polygons. ACM J. Exp. Algorithmics 27: 2.2:1-2.2:11 (2022) - [j2]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso:
Shadoks Approach to Low-Makespan Coordinated Motion Planning. ACM J. Exp. Algorithmics 27: 3.2:1-3.2:17 (2022) - 2020
- [j1]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard:
Efficiently Testing Digital Convexity and Recognizing Digital Convex Polygons. J. Math. Imaging Vis. 62(5): 693-703 (2020)
Conference and Workshop Papers
- 2022
- [c6]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo:
Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge). SoCG 2022: 71:1-71:8 - 2021
- [c5]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso:
Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge). SoCG 2021: 63:1-63:9 - [c4]Loïc Crombez:
Digital Convex + Unimodular Mapping = 8-Connected (All Points but One 4-Connected). DGMM 2021: 164-176 - [c3]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard:
Efficient Algorithms for Battleship. FUN 2021: 11:1-11:15 - 2019
- [c2]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard:
Peeling Digital Potatoes. CCCG 2019: 124-132 - [c1]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gérard:
Efficient Algorithms to Test Digital Convexity. DGCI 2019: 409-419
Informal and Other Publications
- 2023
- [i7]Loïc Crombez, Guilherme Dias da Fonseca, Florian Fontan, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso, Benjamin Momège, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng:
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring. CoRR abs/2303.09632 (2023) - 2021
- [i6]Loïc Crombez:
Digital Convex + Unimodular Mapping =8-Connected (All Points but One 4-Connected). CoRR abs/2103.04971 (2021) - [i5]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso:
Shadoks Approach to Low-Makespan Coordinated Motion Planning. CoRR abs/2103.13956 (2021) - [i4]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard:
Greedy and Local Search Heuristics to Build Area-Optimal Polygons. CoRR abs/2106.14728 (2021) - 2020
- [i3]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard:
Efficient Algorithms for Battleship. CoRR abs/2004.07354 (2020) - 2019
- [i2]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gérard:
Efficient Algorithms to Test Digital Convexity. CoRR abs/1901.04738 (2019) - 2018
- [i1]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gérard:
Peeling Digital Potatoes. CoRR abs/1812.05410 (2018)
Coauthor Index
aka: Yan Gerard
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 22:57 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:
