„Algorithms & Data Structures“

Suchergebnisse

3.154 Treffer

• New Binary Search Tree Bounds via Geometric Inversions
  Chalermsook, Parinya ; Jiamjitrak, Wanchote Po 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Reconstructing Biological and Digital Phylogenetic Trees in Parallel
  Afshar, Ramtin ; Goodrich, Michael T. ; Matias, Pedro ; Osegueda, Martha C. 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Space Efficient Construction of Lyndon Arrays in Linear Time
  Bille, Philip ; Ellert, Jonas ; Fischer, Johannes ; Gørtz, Inge Li ; Kurpicz, Florian ; Munro, J. Ian ; Rotenberg, Eva 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Algorithms for Subpath Convex Hull Queries and Ray-Shooting Among Segments
  Wang, Haitao 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• FM-Index Reveals the Reverse Suffix Array
  Ganguly, Arnab ; Gibney, Daniel ; Hooshmand, Sahar ; Külekci, M. Oğuzhan ; Thankachan, Sharma V. 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Optimal Joins Using Compact Data Structures
  Navarro, Gonzalo ; Reutter, Juan L. ; Rojas-Ledesma, Javiel 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure
  Bodlaender, Hans L. ; Groenland, Carla ; Jacob, Hugo ; Jaffke, Lars ; Lima, Paloma T.
• Diverse Pairs of Matchings
  Fomin, Fedor V. ; Golovach, Petr A. ; Jaffke, Lars ; Philip, Geevarghese ; Sagunov, Danil
• Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry
  Bläsius, Thomas ; Friedrich, Tobias ; Katzmann, Maximilian
• A Polynomial Kernel for 3-Leaf Power Deletion
  Ahn, Jungho ; Eiben, Eduard ; Kwon, O.-joung ; Oum, Sang-il
• Parameterised Counting in Logspace
  Haak, Anselm ; Meier, Arne ; Prakash, Om ; Rao, B. V. Raghavendra
• MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems
  Nikoletseas, Sotiris ; Raptopoulos, Christoforos ; Spirakis, Paul G.
• Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion
  Ahn, Jungho ; Kim, Eun Jung ; Lee, Euiwoong
• Finding Temporal Paths Under Waiting Time Constraints
  Casteigts, Arnaud ; Himmel, Anne-Sophie ; Molter, Hendrik ; Zschoche, Philipp
• Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
  Fomin, Fedor V. ; Golovach, Petr A.
• External Memory Planar Point Location with Fast Updates
  Iacono, John ; Karsin, Ben ; Koumoutsos, Grigorios 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Path and Ancestor Queries over Trees with Multidimensional Weight Vectors
  He, Meng ; Kazi, Serikzhan 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parallel Finger Search Structures
  Gilbert, Seth ; Lim, Wei Quan 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Proving Tree Algorithms for Succinct Data Structures
  Affeldt, Reynald ; Garrigue, Jacques ; Qi, Xuanrui ; Tanaka, Kazunari 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Concurrent Algorithms and Data Structures for Model Checking (Invited Talk)
  van de Pol, Jaco 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik