default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 290 matches
- 2024
- Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon:
The rotation distance of brooms. Eur. J. Comb. 118: 103877 (2024) - Margaux Schmied, Jean-Charles Régin:
Efficient Implementation of the Global Cardinality Constraint with Costs. CP 2024: 27:1-27:18 - Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono:
A General Technique for Searching in Implicit Sets via Function Inversion. SOSA 2024: 215-223 - Andrei Asinowski, Jean Cardinal, Stefan Felsner, Éric Fusy:
Combinatorics of rectangulations: Old and new bijections. CoRR abs/2402.01483 (2024) - Jean Cardinal, Lionel Pournin:
The expansion of half-integral polytopes. CoRR abs/2402.14343 (2024) - Jean Cardinal, Vincent Pilaud:
Rectangulotopes. CoRR abs/2404.17349 (2024) - Jean Cardinal:
The Complexity of Intersection Graphs of Lines in Space and Circle Orders. CoRR abs/2406.17504 (2024) - Marcus Schaefer, Jean Cardinal, Tillmann Miltzow:
The Existential Theory of the Reals as a Complexity Class: A Compendium. CoRR abs/2407.18006 (2024) - Maike Buchin, Jean Cardinal, Arnaud de Mesmay, Jonathan Spreer, Alex He:
Triangulations in Geometry and Topology (Dagstuhl Seminar 24072). Dagstuhl Reports 14(2): 120-163 (2024) - 2023
- Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir:
Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model. Comput. Geom. 109: 101945 (2023) - Jean Cardinal, Kolja Knauer, Piotr Micek, Dömötör Pálvölgyi, Torsten Ueckerdt, Narmada Varadarajan:
Colouring bottomless rectangles and arborescences. Comput. Geom. 115: 102020 (2023) - Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Ondrej Micka, Torsten Mütze:
Combinatorial Generation via Permutation Languages. V. Acyclic Orientations. SIAM J. Discret. Math. 37(3): 1509-1547 (2023) - Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Competitive Online Search Trees on Trees. ACM Trans. Algorithms 19(3): 25:1-25:19 (2023) - Pilar Cano, Sujoy Bhore, Prosenjit Bose, Jean Cardinal, John Iacono:
Dynamic Schnyder woods. CCCG 2023: 97-104 - Jean Cardinal, Micha Sharir:
Improved Algebraic Degeneracy Testing. SoCG 2023: 22:1-22:16 - Jean Cardinal, Raphael Steiner:
Inapproximability of Shortest Paths on Perfect Matching Polytopes. IPCO 2023: 72-86 - Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Torsten Mütze:
Zigzagging through acyclic orientations of chordal graphs and hypergraphs. SODA 2023: 3029-3042 - Jean Cardinal, Raphael Steiner:
Shortest paths on polymatroids and hypergraphic polytopes. CoRR abs/2311.00779 (2023) - Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono:
A General Technique for Searching in Implicit Sets via Function Inversion. CoRR abs/2311.12471 (2023) - 2022
- Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber:
Drawing Graphs as Spanners. Discret. Comput. Geom. 68(3): 774-795 (2022) - Boris Aronov, Jean Cardinal:
Geometric Pattern Matching Reduces to k-SUM. Discret. Comput. Geom. 68(3): 850-859 (2022) - Jean Cardinal, Aurélien Ooms:
Algorithms for approximate sparse regression and nearest induced hulls. J. Comput. Geom. 13(1) (2022) - Jonathan Jalbert, Héloïse Cardinal, Andrea Lodi, Jean-Noël Weller, Hugo-Maxime Tocco:
Predicting Waiting Time and Quality of Kidney Offers for Kidney Transplant Candidates. AIME 2022: 220-229 - Pierre Nerzic, Grégory Smits, Olivier Pivert, Marie-Jeanne Lesot:
Massive Data Exploration using Estimated Cardinalities. FUZZ-IEEE 2022: 1-8 - Pierre Nerzic, Grégory Smits, Olivier Pivert, Marie-Jeanne Lesot:
Exploration de données massives à l'aide d'estimations de cardinalités. LFA 2022 - Jean Cardinal, Arturo Merino, Torsten Mütze:
Efficient generation of elimination trees and graph associahedra. SODA 2022: 2128-2140 - Jean Cardinal, Raphael Steiner:
Inapproximability of shortest paths on perfect matching polytopes. CoRR abs/2210.14608 (2022) - Rémy Scholler, Jean-François Couchot, Oumaima Alaoui Ismaili, Denis Renaud, Eric Ballot:
In-stream Probabilistic Cardinality Estimation for Bloom Filters. CoRR abs/2210.15630 (2022) - Jean Cardinal, Micha Sharir:
Improved Algebraic Degeneracy Testing. CoRR abs/2212.03030 (2022) - Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Ondrej Micka, Torsten Mütze:
Combinatorial generation via permutation languages. V. Acyclic orientations. CoRR abs/2212.03915 (2022)
skipping 260 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-09-20 00:17 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint