„Algorithms & Data Structures“

Suchergebnisse

3.154 Treffer

• Top Tree Compression of Tries
  Bille, Philip ; Gawrychowski, Paweł ; Gørtz, Inge Li ; Landau, Gad M. ; Weimann, Oren
• Compact Distributed Certification of Planar Graphs
  Feuilloley, Laurent ; Fraigniaud, Pierre ; Montealegre, Pedro ; Rapaport, Ivan ; Rémila, Éric ; Todinca, Ioan
• On Structural Parameterizations of the Edge Disjoint Paths Problem
  Ganian, Robert ; Ordyniak, Sebastian ; Ramanujan, M. S.
• Parameterized Complexity of Geometric Covering Problems Having Conflicts
  Banik, Aritra ; Panolan, Fahad ; Raman, Venkatesh ; Sahlot, Vibha ; Saurabh, Saket
• 29th International Symposium on Algorithms and Computation (ISAAC 2018)
  Hsu, Wen-Lian ; Lee, Der-Tsai ; Liao, Chung-Shou 2018 Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
• Special issue of the 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2015)
  Baier, Christel ; Tinelli, Cesare
• Opinion Dynamics with Limited Information
  Fotakis, Dimitris ; Kandiros, Vardis ; Kontonis, Vasilis ; Skoulakis, Stratis
• Project scheduling with irregular costs: complexity, approximability, and algorithms
  Grigoriev, Alexander ; Woeginger, Gerhard J.
• DPASF: a flink library for streaming data preprocessing
  Alcalde-Barros, Alejandro ; García-Gil, Diego ; García, Salvador ; Herrera, Francisco
• Colored Bin Packing: Online Algorithms and Lower Bounds
  Böhm, Martin ; Dósa, György ; Epstein, Leah ; Sgall, Jiří ; Veselý, Pavel
• Metrics and Algorithms for Locally Fair and Accurate Classifications using Ensembles
  Lässig, Nico ; Oppold, Sarah ; Herschel, Melanie
• Partial and Simultaneous Transitive Orientations via Modular Decompositions
  Münch, Miriam ; Rutter, Ignaz ; Stumpf, Peter
• Best-of-Both-Worlds Analysis of Online Search
  Angelopoulos, Spyros ; Dürr, Christoph ; Jin, Shendan
• Dynamic and Internal Longest Common Substring
  Amir, Amihood ; Charalampopoulos, Panagiotis ; Pissis, Solon P. ; Radoszewski, Jakub
• Matchings with Lower Quotas: Algorithms and Complexity
  Arulselvan, Ashwin ; Cseh, Ágnes ; Groß, Martin ; Manlove, David F. ; Matuschke, Jannik
• Finding Dominating Induced Matchings in $$P_8$$ P 8 -Free Graphs in Polynomial Time
  Brandstädt, Andreas ; Mosca, Raffaele
• Better Hardness Results for the Minimum Spanning Tree Congestion Problem
  Luu, Huong ; Chrobak, Marek
• Approximation Algorithms for Covering Vertices by Long Paths
  Gong, Mingyang ; Edgar, Brett ; Fan, Jing ; Lin, Guohui ; Miyano, Eiji
• Randomized Online Computation with High Probability Guarantees
  Komm, Dennis ; Královič, Rastislav ; Královič, Richard ; Mömke, Tobias
• A Refined Branching Algorithm for the Maximum Satisfiability Problem
  Li, Wenjun ; Xu, Chao ; Yang, Yongjie ; Chen, Jianer ; Wang, Jianxin