The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "Algorithmica"( http://dblp.L3S.de/Venues/Algorithmica )

URL (DBLP): http://dblp.uni-trier.de/db/journals/algorithmica

Publication years (Num. hits)
1986 (29) 1987 (27) 1988 (26) 1989 (36) 1990 (33) 1991 (47) 1992 (57) 1993 (58) 1994 (60) 1995 (54) 1996 (68) 1997 (79) 1998 (73) 1999 (68) 2000 (73) 2001 (89) 2002 (95) 2003 (53) 2004 (74) 2005 (54) 2006 (77) 2007 (77) 2008 (79) 2009 (96) 2010 (125) 2011 (133) 2012 (136) 2013 (108) 2014 (119) 2015 (130) 2016 (146) 2017 (158) 2018 (164) 2019 (161) 2020 (140) 2021 (129) 2022 (140) 2023 (137) 2024 (58)
Publication types (Num. hits)
article(3466)
Venues (Conferences, Journals, ...)
Algorithmica(3466)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1597 occurrences of 761 keywords

Results
Found 3466 publication records. Showing 3466 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Felicia Lucke, Felix Mann Reducing Graph Parameters by Contractions and Deletions. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Tomasz Kociumaka, Gonzalo Navarro 0001, Francisco Olivares Near-Optimal Search Time in δ-Optimal Space, and Vice Versa. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Michal Feldman, Federico Fusco, Stefano Leonardi 0001, Simon Mauras, Rebecca Reiffenhäuser Truthful Matching with Online Items and Offline Agents. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini Recognizing Map Graphs of Bounded Treewidth. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Giulia Punzi, Alessio Conte, Roberto Grossi, Romeo Rizzi Refined Bounds on the Number of Eulerian Tours in Undirected Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Benjamin Doerr, Amirhossein Rajabi, Carsten Witt Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Yuefang Lian, Donglei Du, Xiao Wang, Dachuan Xu, Yang Zhou 0018 Stochastic Variance Reduction for DR-Submodular Maximization. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Charis Papadopoulos, Spyridon Tzimas Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1T.-H. Hubert Chan, Silvio Lattanzi, Mauro Sozio, Bo Wang Fully Dynamic k-Center Clustering with Outliers. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Sumanta Ghosh, Rohit Gurjar, Roshan Raj A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Ishay Haviv On Finding Constrained Independent Sets in Cycles. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Liting Huang, Wei Yu, Zhaohui Liu Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover Problem and Its Variants. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Tesshu Hanaka, Hironori Kiya, Hirotaka Ono 0001, Kanae Yoshiwatari Winner Determination Algorithms for Graph Games with Matching Structures. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Oswin Aichholzer, Ruy Fabila Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, Birgit Vogtenhuber Perfect Matchings with Crossings. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Stepan Artamonov, Maxim A. Babenko Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Yicheng Xu, Vincent Chau, Chenchen Wu, Yong Zhang 0001, Vassilis Zissimopoulos, Yifei Zou A Semi Brute-Force Search Approach for (Balanced) Clustering. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale Domination and Cut Problems on Chordal Graphs with Bounded Leafage. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Henry Bambury, Antoine Bultel, Benjamin Doerr An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Charis Papadopoulos, Athanasios E. Zisis Computing and Listing Avoidable Vertices and Paths. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Sergio Cabello, David Gajser Connectivity with Uncertainty Regions Given as Line Segments. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng On the d-Claw Vertex Deletion Problem. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Jan Bok, Jirí Fiala 0001, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski List Covering of Regular Multigraphs with Semi-edges. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant 1-Extendability of Independent Sets. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov Exploration of High-Dimensional Grids by Finite State Machines. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Jin-Yi Cai, Ashwin Maran Counting Cycles on Planar Graphs in Subexponential Time. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Philip Bille, Inge Li Gørtz, Tord Stordalen Predecessor on the Ultra-Wide Word RAM. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Mario Alejandro Hevia Fajardo, Dirk Sudholt Self-adjusting Population Sizes for Non-elitist Evolutionary Algorithms: Why Success Rates Matter. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Julien Courtiel, Paul Dorbec, Romain Lecoq Theoretical Analysis of Git Bisect. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Per Kristian Lehre, Xiaoyu Qin More Precise Runtime Analyses of Non-elitist Evolutionary Algorithms in Uncertain Environments. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Leslie Ann Goldberg, Marc Roth Parameterised and Fine-Grained Subgraph Counting, Modulo 2. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Pierre Fraigniaud, Pedro Montealegre 0001, Ivan Rapaport, Ioan Todinca A Meta-Theorem for Distributed Certification. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Andrew Alseth, Matthew J. Patitz The Need for Seed (in the Abstract Tile Assembly Model). Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Marten Maack, Friedhelm Meyer auf der Heide, Simon Pukrop Server Cloud Scheduling. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Sheng-Yen Ko, Ho-Lin Chen, Siu-Wing Cheng, Wing-Kai Hon, Chung-Shou Liao Polynomial-time Combinatorial Algorithm for General Max-Min Fair Allocation. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Ajinkya Gaikwad, Soumen Maity On Structural Parameterizations of the Harmless Set Problem. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Shyan Akmal, Ce Jin 0001 An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Benjamin Qi On Maximizing Sums of Non-monotone Submodular and Linear Functions. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel 0001, Saket Saurabh 0001 Improved FPT Algorithms for Deletion to Forest-Like Structures. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Cristina Bazgan, Henning Fernau Preface of the Special Issue Dedicated to Selected Papers from IWOCA 2022. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Liad Blumrosen, Shahar Dobzinski Combinatorial Reallocation Mechanisms. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Benjamin Doerr, Yassine Ghannane, Marouane Ibn Brahim Runtime Analysis for Permutation-based Evolutionary Algorithms. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Moran Feldman, Ariel Szarf Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Joanna Raczek Complexity Issues on of Secondary Domination Number. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Xiangyu Guo, Shi Li 0001, Kelin Luo, Yuhao Zhang 0001 Minimizing the Maximum Flow Time in the Online Food Delivery Problem. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz Token Sliding on Graphs of Girth Five. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Youhei Akimoto Analysis of Surrogate-Assisted Information-Geometric Optimization Algorithms. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Dylan Hyatt-Denesik, Mirmahdi Rahgoshay, Mohammad R. Salavatipour Approximations for Throughput Maximization. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Yasushi Kawase, Hanna Sumita Randomized Strategies for Robust Combinatorial Optimization with Approximate Separation. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Benjamin Doerr, Timo Kötzing Lower Bounds from Fitness Levels Made Easy. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Miriam Münch, Ignaz Rutter, Peter Stumpf Partial and Simultaneous Transitive Orientations via Modular Decompositions. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Denis Antipov, Maxim Buzdalov 0001, Benjamin Doerr Lazy Parameter Tuning and Control: Choosing All Parameters Randomly from a Power-Law Distribution. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Takuya Mieno, Mitsuru Funakoshi Data Structures for Computing Unique Palindromes in Static and Non-Static Strings. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Mingyang Gong, Zhi-Zhong Chen, Kuniteru Hayashi Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Mingyu Xiao 0001, Sen Huang, Xiaoyu Chen Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Arnab Maiti, Palash Dey On Parameterized Complexity of Binary Networked Public Goods Game. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki Computing Generalized Convolutions Faster Than Brute Force. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Tatsuya Gima, Yota Otachi Extended MSO Model Checking via Small Vertex Integrity. Search on Bibsonomy Algorithmica The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Paola Flocchini, Lucia Moura Selected Papers of the 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Yoshiharu Kohayakawa, Flávio Keidi Miyazawa Guest Editorial: Special Issue on Theoretical Informatics. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi Parameterized Study of Steiner Tree on Unit Disk Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Gaétan Berthe, Barnaby Martin, Daniël Paulusma, Siani Smith The Complexity of L(p, q)-Edge-Labelling. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Di Chen, Mordecai J. Golin Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Teresa Anna Steiner Gapped Indexing for Consecutive Occurrences. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Mark de Berg, Aleksandar Markovic 0001, Seeun William Umboh The Online Broadcast Range-Assignment Problem. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1 Special Issue on Algorithms and Computation (ISAAC 2021). Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Gill Barequet, Gil Ben-Shachar Algorithms for Counting Minimum-Perimeter Lattice Animals. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Benjamin Merlin Bumpus, Kitty Meeks Edge Exploration of Temporal Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko Social Distancing Network Creation. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1K. Subramani 0001, Piotr Wojciechowski 0002 Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Stephan Dominique Andres, François Dross, Melissa A. Huggan, Fionn Mc Inerney, Richard J. Nowakowski The Complexity of Two Colouring Games. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Martin Kucera, Ondrej Suchý Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak, C. S. Rahul 0001 Group Activity Selection with Few Agent Types. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sushmita Gupta, Pallavi Jain 0001, Saket Saurabh 0001, Nimrod Talmon Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Arindam Khan 0001, Eklavya Sharma Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann 0001, Sergey Pupyrev Lazy Queue Layouts of Posets. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Abolfazl Asudeh, Tanya Y. Berger-Wolf, Bhaskar DasGupta, Anastasios Sidiropoulos Maximizing Coverage While Ensuring Fairness: A Tale of Conflicting Objectives. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Dimitris Fotakis 0001, Anthimos Vardis Kandiros, Vasilis Kontonis, Stratis Skoulakis Opinion Dynamics with Limited Information. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Alexander Meiburg Inapproximability of Positive Semidefinite Permanents and Quantum State Tomography. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Mathew C. Francis, Pavol Hell, Dalu Jacob On the Kernel and Related Problems in Interval Digraphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Thomas Bläsius, Tobias Friedrich 0001, Maximilian Katzmann Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Maël Dumas, Anthony Perez 0001, Ioan Todinca A Cubic Vertex-Kernel for Trivially Perfect Editing. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum A Polynomial Kernel for 3-Leaf Power Deletion. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Thomas Erlebach, Michael Hoffmann 0002, Murilo Santos de Lima Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno Immunization in the Threshold Model: A Parameterized Complexity Study. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Asaf Levin Online Minimization of the Maximum Starting Time: Migration Helps. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Harold N. Gabow Blocking Trails for f-factors of Multigraphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Walter Didimo, Michael Kaufmann 0001, Giuseppe Liotta, Giacomo Ortali Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi 0001, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal 0001, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi Parameterized Complexity of Minimum Membership Dominating Set. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Felicia Lucke, Daniël Paulusma, Bernard Ries Finding Matching Cuts in H-Free Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Vlady Ravelomanana, Ny Aina Andriambolamalala Transmitting Once to Elect a Leader on Wireless Networks. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Peter Jonsson, Victor Lagerkvist General Lower Bounds and Improved Algorithms for Infinite-Domain CSPs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Luciano Gualà, Stefano Leucci 0001, Isabella Ziccardi Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1William J. Lenhart, Giuseppe Liotta, Debajyoti Mondal, Rahnuma Islam Nishat Drawing Partial 2-Trees with Few Slopes. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Seth Gilbert, Peter Robinson 0002, Suman Sourav Leader Election in Well-Connected Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai 0001, Pawel Rzazewski Parameterized Inapproximability of Independent Set in H-Free Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Matthias Bentert, André Nichterlein Parameterized Complexity of Diameter. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 3466 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license