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
no matches
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 1,662 matches
- 2023
- Robert M. Alaniz, Michael J. Coulombe, Erik D. Demaine, Bin Fu, Ryan Knobel, Timothy Gomez, Elise Grizzell, Andrew Rodriguez, Robert T. Schweller, Tim Wylie:
Reconfiguration of Linear Surface Chemical Reaction Networks with Bounded State Change. CCCG 2023: 265-271 - Yeganeh Bahoo, Onur Cagirici, Kody Manastyrski, Rahnuma Islam Nishat, Christopher Kolios, Roni Sherman:
Conflict-Free Chromatic Guarding of Orthogonal Polygons with Sliding Cameras. CCCG 2023: 63-70 - Nilanjana G. Basu, Subhashis Majumder, Partha Bhowmick:
On Density Extrema for Digital '1-Balls in 2D and 3D. CCCG 2023: 313-319 - Michael A. Bekos, Michael Kaufmann, Maria Eleni Pavlidi, Xenia Rieger:
On the Deque and Rique Numbers of Complete and Complete Bipartite Graphs. CCCG 2023: 89-95 - Therese Biedl, David Eppstein, Torsten Ueckerdt:
On the complexity of embedding in graph products. CCCG 2023: 77-88 - Ahmad Biniaz, Prosenjit Bose, Thomas C. Shermer:
Piercing Unit Geodesic Disks. CCCG 2023: 43-49 - Ahmad Biniaz, Mohammad Hashemi:
City Guarding with Cameras of Bounded Field of View. CCCG 2023: 71-76 - Prosenjit Bose, Anthony D'Angelo, Stephane Durocher:
CCOSKEG Discs in Simple Polygons. CCCG 2023: 129-152 - Pilar Cano, Sujoy Bhore, Prosenjit Bose, Jean Cardinal, John Iacono:
Dynamic Schnyder woods. CCCG 2023: 97-104 - Erin W. Chambers, Benjamin Holmgren, Brittany Terese Fasy, Sushovan Majhi, Carola Wenk:
Metric and Path-Connectedness Properties of the Fréchet Distance for Paths and Graphs. CCCG 2023: 213-224 - Oliver A. Chubet, Parth Parikh, Donald R. Sheehy, Siddharth S. Sheth:
Approximating the Directed Hausdorff Distance. CCCG 2023: 175-189 - Chaeyoon Chung, Taehoon Ahn, Sang Won Bae, Hee-Kap Ahn:
Parallel Line Centers with Guaranteed Separation. CCCG 2023: 153-159 - Ovidiu Daescu, Ka Yaw Teo:
Approximate Line Segment Nearest Neighbor Search amid Polyhedra in 3-Space. CCCG 2023: 291-297 - Emily Downing, Stephanie Einstein, Elizabeth Hartung, Aaron Williams:
Catalan Squares and Staircases: Relayering and Repositioning Gray Codes. CCCG 2023: 273-281 - Stephane Durocher, J. Mark Keil, Debajyoti Mondal:
Minimum Ply Covering of Points with Unit Disks. CCCG 2023: 19-25 - Stephane Durocher, Shahin Kamali, Pouria Zamani Nezhad:
Online Square Packing with Predictions. CCCG 2023: 9-18 - David Eppstein:
A Parameterized Algorithm for Flat Folding. CCCG 2023: 35-42 - David Eppstein, Rose McCarty:
Geometric Graphs with Unbounded Flip-Width. CCCG 2023: 197-206 - Auguste H. Gezalyan, Madeline Bumpus, Xufeng Dai, Sam Muñoz, Renita Santhoshkumar, Songyu Ye, David M. Mount:
Software and Analysis for Dynamic Voronoi Diagrams in the Hilbert Metric. CCCG 2023: 249-255 - Sariel Har-Peled, Benjamin Raichel:
On the Budgeted Hausdorff Distance Problem. CCCG 2023: 169-173 - Qizheng He:
On the FPT Status of Monotone Convex Chain Cover. CCCG 2023: 307-312 - Diego Ihara, Karine Chubarian, Bohan Fan, Francesco Sgherzi, Thiruvenkadam S. Radhakrishnan, Anastasios Sidiropoulos, Angelo Straight:
Geometric Algorithms for k-NN Poisoning. CCCG 2023: 105-112 - Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique. CCCG 2023: 183-189 - Mook Kwon Jung, Sang Duk Yoon, Hee-Kap Ahn, Takeshi Tokuyama:
Universal convex covering problems under affine dihedral group actions. CCCG 2023: 299-305 - Shahin Kamali, Mohammadmasoud Shabanijou:
Improved Algorithms for Burning Planar Point Sets. CCCG 2023: 161-167 - Yuki Kawakami, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh:
Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs. CCCG 2023: 191-196 - Georgiy Klimenko, Benjamin Raichel:
Square Hardness for Clustering with Neighborhoods. CCCG 2023: 123-127 - Sushovan Majhi:
Graph Mover's Distance: An Efficiently Computable Distance Measure for Geometric Graphs. CCCG 2023: 207-212 - Joseph O'Rourke:
Every Combinatorial Polyhedron Can Unfold with Overlap. CCCG 2023: 257-263 - Joseph O'Rourke, Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Anna Lubiw, Jayson Lynch, Frederick Stock:
Super Guarding and Dark Rays in Art Galleries. CCCG 2023: 51-61
skipping 1,632 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-23 10:56 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