FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2127618615> ?p ?o ?g. }

• W2127618615 abstract "Graphs and Algorithms A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V. We study the following extremal problem for geometric graphs: How many arbitrary edges can be removed from a complete geometric graph with n vertices such that the remaining graph still contains a certain non-crossing subgraph. The non-crossing subgraphs that we consider are perfect matchings, subtrees of a given size, and triangulations. In each case, we obtain tight bounds on the maximum number of removable edges." @default.
• W2127618615 created "2016-06-24" @default.
• W2127618615 creator A5002294363 @default.
• W2127618615 creator A5028870285 @default.
• W2127618615 creator A5032873622 @default.
• W2127618615 creator A5034923438 @default.
• W2127618615 creator A5046888634 @default.
• W2127618615 creator A5066302647 @default.
• W2127618615 creator A5086184788 @default.
• W2127618615 creator A5091823049 @default.
• W2127618615 date "2010-01-01" @default.
• W2127618615 modified "2023-10-03" @default.
• W2127618615 title "Edge-Removal and Non-Crossing Configurations in Geometric Graphs" @default.
• W2127618615 cites W1524959429 @default.
• W2127618615 cites W1597538628 @default.
• W2127618615 cites W1993625763 @default.
• W2127618615 cites W1995451337 @default.
• W2127618615 cites W2001906404 @default.
• W2127618615 cites W2005247788 @default.
• W2127618615 cites W2010965904 @default.
• W2127618615 cites W2042517851 @default.
• W2127618615 cites W2042630920 @default.
• W2127618615 cites W2048256194 @default.
• W2127618615 cites W2057585861 @default.
• W2127618615 cites W2075509416 @default.
• W2127618615 cites W2089301616 @default.
• W2127618615 cites W2089506206 @default.
• W2127618615 cites W2118113811 @default.
• W2127618615 cites W2125993726 @default.
• W2127618615 cites W2319149236 @default.
• W2127618615 cites W2367144953 @default.
• W2127618615 cites W564413792 @default.
• W2127618615 cites W574688124 @default.
• W2127618615 cites W81214886 @default.
• W2127618615 cites W981027015 @default.
• W2127618615 doi "https://doi.org/10.46298/dmtcs.525" @default.
• W2127618615 hasPublicationYear "2010" @default.
• W2127618615 type Work @default.
• W2127618615 sameAs 2127618615 @default.
• W2127618615 citedByCount "5" @default.
• W2127618615 countsByYear W21276186152013 @default.
• W2127618615 countsByYear W21276186152015 @default.
• W2127618615 countsByYear W21276186152016 @default.
• W2127618615 countsByYear W21276186152018 @default.
• W2127618615 crossrefType "journal-article" @default.
• W2127618615 hasAuthorship W2127618615A5002294363 @default.
• W2127618615 hasAuthorship W2127618615A5028870285 @default.
• W2127618615 hasAuthorship W2127618615A5032873622 @default.
• W2127618615 hasAuthorship W2127618615A5034923438 @default.
• W2127618615 hasAuthorship W2127618615A5046888634 @default.
• W2127618615 hasAuthorship W2127618615A5066302647 @default.
• W2127618615 hasAuthorship W2127618615A5086184788 @default.
• W2127618615 hasAuthorship W2127618615A5091823049 @default.
• W2127618615 hasBestOaLocation W21276186151 @default.
• W2127618615 hasConcept C114614502 @default.
• W2127618615 hasConcept C118615104 @default.
• W2127618615 hasConcept C127413603 @default.
• W2127618615 hasConcept C132525143 @default.
• W2127618615 hasConcept C146978453 @default.
• W2127618615 hasConcept C149530733 @default.
• W2127618615 hasConcept C150397156 @default.
• W2127618615 hasConcept C173547177 @default.
• W2127618615 hasConcept C203776342 @default.
• W2127618615 hasConcept C2777724877 @default.
• W2127618615 hasConcept C33923547 @default.
• W2127618615 hasConcept C64543145 @default.
• W2127618615 hasConceptScore W2127618615C114614502 @default.
• W2127618615 hasConceptScore W2127618615C118615104 @default.
• W2127618615 hasConceptScore W2127618615C127413603 @default.
• W2127618615 hasConceptScore W2127618615C132525143 @default.
• W2127618615 hasConceptScore W2127618615C146978453 @default.
• W2127618615 hasConceptScore W2127618615C149530733 @default.
• W2127618615 hasConceptScore W2127618615C150397156 @default.
• W2127618615 hasConceptScore W2127618615C173547177 @default.
• W2127618615 hasConceptScore W2127618615C203776342 @default.
• W2127618615 hasConceptScore W2127618615C2777724877 @default.
• W2127618615 hasConceptScore W2127618615C33923547 @default.
• W2127618615 hasConceptScore W2127618615C64543145 @default.
• W2127618615 hasIssue "Graph and Algorithms" @default.
• W2127618615 hasLocation W21276186151 @default.
• W2127618615 hasLocation W21276186152 @default.
• W2127618615 hasLocation W21276186153 @default.
• W2127618615 hasLocation W21276186154 @default.
• W2127618615 hasLocation W21276186155 @default.
• W2127618615 hasLocation W21276186156 @default.
• W2127618615 hasLocation W21276186157 @default.
• W2127618615 hasOpenAccess W2127618615 @default.
• W2127618615 hasPrimaryLocation W21276186151 @default.
• W2127618615 hasRelatedWork W2057585861 @default.
• W2127618615 hasRelatedWork W2124128624 @default.
• W2127618615 hasRelatedWork W2127618615 @default.
• W2127618615 hasRelatedWork W2161553130 @default.
• W2127618615 hasRelatedWork W2941402163 @default.
• W2127618615 hasRelatedWork W2950721507 @default.
• W2127618615 hasRelatedWork W3163128904 @default.
• W2127618615 hasRelatedWork W4286794285 @default.
• W2127618615 hasRelatedWork W4297580863 @default.
• W2127618615 hasRelatedWork W4298183188 @default.
• W2127618615 hasVolume "Vol. 12 no. 1" @default.
• W2127618615 isParatext "false" @default.

• next