Upward Point Set Embeddings of Paths and Trees

Upward Point Set Embeddings of Paths and Trees

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:WALCOM (15. : 2021 : Online) WALCOM: algorithms and computation
1. Verfasser: Arseneva, Elena (VerfasserIn)
Weitere Verfasser: Cano, Pilar (VerfasserIn), Kleist, Linda (VerfasserIn), Mchedlidze, Tamara (VerfasserIn), Mehrabi, Saeed (VerfasserIn), Parada, Irene (VerfasserIn), Valtr, Pavel (VerfasserIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2021
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game 2021 Byrne, Thomas
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes 2021 Saitoh, Toshiki
Homomorphisms to Digraphs with Large Girth and Oriented Colorings of Minimal Series-Parallel Digraphs 2021 Gurski, Frank
Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights 2021 Fujie, Tetsuya
Efficient Generation of a Card-Based Uniformly Distributed Random Derangement 2021 Murata, Soma
Majority Spanning Trees, Cotrees and Their Applications 2021 Kaykobad, Mohammad
A New Transportation Problem on a Graph with Sending and Bringing-Back Operations 2021 Asano, Tetsuo
On Short Fastest Paths in Temporal Graphs 2021 Danda, Umesh Sandeep
On Compatible Matchings 2021 Aichholzer, Oswin
2-Colored Point-Set Embeddings of Partial 2-Trees 2021 Giacomo, Emilio Di
Better Approximation Algorithms for Maximum Weight Internal Spanning Trees in Cubic Graphs and Claw-Free Graphs 2021 Biniaz, Ahmad
Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs 2021 Yamazaki, Kazuaki
Cyclic Shift Problems on Graphs 2021 Sai, Kwon Kham
Mathematical Characterizations and Computational Complexity of Anti-slide Puzzles 2021 Minamisawa, Ko
r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes 2021 Kumabe, Soh
An Improvement of Reed's Treewidth Approximation 2021 Belbasi, Mahdi
Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms 2021 Conte, Alessio
APX-Hardness and Approximation for the k-Buming Number Problem 2021 Mondal, Debajyoti
Computing L(p, 1)-Labeling with Combined Parameters 2021 Hanaka, Tesshu
Upward Point Set Embeddings of Paths and Trees 2021 Arseneva, Elena
Alle Artikel auflisten