Maximum Rectilinear Convex Subsets (Englisch)
- Neue Suche nach: González-Aguilar, Hernán
- Neue Suche nach: Orden, David
- Neue Suche nach: Pérez-Lantero, Pablo
- Neue Suche nach: Rappaport, David
- Neue Suche nach: Seara, Carlos
- Neue Suche nach: Tejel, Javier
- Neue Suche nach: Urrutia, Jorge
- Neue Suche nach: Gąsieniec, Leszek Antoni
- Weitere Informationen zu Gąsieniec, Leszek Antoni:
-
https://orcid.org/https://orcid.org/0000-0003-1809-9814
- Neue Suche nach: Jansson, Jesper
- Weitere Informationen zu Jansson, Jesper:
-
https://orcid.org/https://orcid.org/0000-0001-6859-8932
- Neue Suche nach: Levcopoulos, Christos
- Weitere Informationen zu Levcopoulos, Christos:
-
https://orcid.org/https://orcid.org/0000-0003-0983-7862
- Neue Suche nach: González-Aguilar, Hernán
- Neue Suche nach: Orden, David
- Neue Suche nach: Pérez-Lantero, Pablo
- Neue Suche nach: Rappaport, David
- Neue Suche nach: Seara, Carlos
- Neue Suche nach: Tejel, Javier
- Neue Suche nach: Urrutia, Jorge
In:
Fundamentals of Computation Theory
: 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings
;
Kapitel: 19
;
274-291
;
2019
- Aufsatz/Kapitel (Buch) / Elektronische Ressource
-
Titel:Maximum Rectilinear Convex Subsets
-
Weitere Titelangaben:Lect.Notes Computer
-
Beteiligte:Gąsieniec, Leszek Antoni ( Herausgeber:in ) / Jansson, Jesper ( Herausgeber:in ) / Levcopoulos, Christos ( Herausgeber:in ) / González-Aguilar, Hernán ( Autor:in ) / Orden, David ( Autor:in ) / Pérez-Lantero, Pablo ( Autor:in ) / Rappaport, David ( Autor:in ) / Seara, Carlos ( Autor:in ) / Tejel, Javier ( Autor:in ) / Urrutia, Jorge ( Autor:in )
-
Kongress:International Symposium on Fundamentals of Computation Theory ; 2019 ; Copenhagen, Denmark
-
Erschienen in:Fundamentals of Computation Theory : 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings ; Kapitel: 19 ; 274-291Lecture Notes in Computer Science ; 11651 ; 274-291
-
Verlag:
- Neue Suche nach: Springer International Publishing
-
Erscheinungsort:Cham
-
Erscheinungsdatum:10.07.2019
-
Format / Umfang:18 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz/Kapitel (Buch)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Datenquelle:
Inhaltsverzeichnis E-Book
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Algebraic Theory of Promise Constraint Satisfaction Problems, First StepsBarto, Libor et al. | 2019
- 2
-
Some Observations on Dynamic Random Walks and Network RenormalizationChazelle, Bernard et al. | 2019
- 3
-
Highly Succinct Dynamic Data StructuresHagerup, Torben et al. | 2019
- 4
-
Winning Strategies for Streaming Rewriting GamesCoester, Christian / Schwentick, Thomas / Schuster, Martin et al. | 2019
- 5
-
Nominal Syntax with Atom Substitutions: Matching, Unification, RewritingDomínguez, Jesús / Fernández, Maribel et al. | 2019
- 6
-
Two Characterizations of Finite-State DimensionKozachinskiy, Alexander / Shen, Alexander et al. | 2019
- 7
-
Largest Common Prefix of a Regular Tree LanguageLohrey, Markus / Maneth, Sebastian et al. | 2019
- 8
-
On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph PropertiesArvind, Vikraman / Fuhlbrück, Frank / Köbler, Johannes / Verbitsky, Oleg et al. | 2019
- 9
-
Deterministic Preparation of Dicke StatesBärtschi, Andreas / Eidenbenz, Stephan et al. | 2019
- 10
-
Optimal Channel Utilization with Limited FeedbackDe Marco, Gianluca / Jurdziński, Tomasz / Kowalski, Dariusz R. et al. | 2019
- 11
-
RETRACTED CHAPTER: Complete Disjoint CoNP-Pairs but No Complete Total Polynomial Search Problems Relative to an OracleDose, Titus et al. | 2019
- 12
-
An Efficient Algorithm for the Fast Delivery ProblemCarvalho, Iago A. / Erlebach, Thomas / Papadopoulos, Kleitos et al. | 2019
- 13
-
Extension of Some Edge Graph Problems: Standard and Parameterized ComplexityCasel, Katrin / Fernau, Henning / Khosravian Ghadikolaei, Mehdi / Monnot, Jérôme / Sikora, Florian et al. | 2019
- 14
-
Space Efficient Algorithms for Breadth-Depth SearchChakraborty, Sankardeep / Mukherjee, Anish / Satti, Srinivasa Rao et al. | 2019
- 15
-
Circular Pattern Matching with k MismatchesCharalampopoulos, Panagiotis / Kociumaka, Tomasz / Pissis, Solon P. / Radoszewski, Jakub / Rytter, Wojciech / Straszyński, Juliusz / Waleń, Tomasz / Zuba, Wiktor et al. | 2019
- 16
-
Succinct Representations of Finite GroupsDas, Bireswar / Sharma, Shivdutt / Vaidyanathan, P. R. et al. | 2019
- 17
-
On the Tractability of Covering a Graph with 2-ClubsDondi, Riccardo / Lafond, Manuel et al. | 2019
- 18
-
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear ForestFeghali, Carl / Johnson, Matthew / Paesani, Giacomo / Paulusma, Daniël et al. | 2019
- 19
-
Maximum Rectilinear Convex SubsetsGonzález-Aguilar, Hernán / Orden, David / Pérez-Lantero, Pablo / Rappaport, David / Seara, Carlos / Tejel, Javier / Urrutia, Jorge et al. | 2019
- 20
-
Computing Digraph Width Measures on Directed Co-graphsGurski, Frank / Komander, Dominique / Rehs, Carolin et al. | 2019
- 21
-
Fault-Tolerant Parallel Scheduling of Arbitrary Length Jobs on a Shared ChannelKlonowski, Marek / Kowalski, Dariusz R. / Mirek, Jarosław / Wong, Prudence W. H. et al. | 2019
- 22
-
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern GraphsKowaluk, Mirosław / Lingas, Andrzej et al. | 2019
- 23
-
Bivariate B-Splines from Convex Pseudo-circle ConfigurationsSchmitt, Dominique et al. | 2019
- 24
-
The Fault-Tolerant Metric Dimension of CographsVietz, Duygu / Wanke, Egon et al. | 2019