Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Pranabendu Misra, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi |
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(7), pp. 2065-2086, July 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sergey Bereg |
Computing Balanced Convex Partitions of Lines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(8), pp. 2515-2528, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Harold N. Gabow |
A Weight-Scaling Algorithm for f-Factors of Multigraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(10), pp. 3214-3289, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Pierre Aboulker, Édouard Bonnet, Eun Jung Kim 0002, Florian Sikora |
Grundy Coloring and Friends, Half-Graphs, Bicliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(1), pp. 1-28, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Júlio Araújo 0001, Julien Bensmail, Victor A. Campos, Frédéric Havet, Ana Karolinna Maia, Nicolas Nisse, Ana Silva 0001 |
On Finding the Best and Worst Orientations for the Metric Dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(10), pp. 2962-3002, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Anthony Bonato, Konstantinos Georgiou, Calum MacRury, Pawel Pralat |
Algorithms for p-Faulty Search on a Half-Line. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(8), pp. 2485-2514, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Shyan Akmal, Ce Jin 0001 |
Near-Optimal Quantum Algorithms for String Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(8), pp. 2260-2317, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Felix Reidl, Blair D. Sullivan |
A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(8), pp. 2318-2347, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Manas Jyoti Kashyop, N. S. Narayanaswamy, Meghana Nasre, Sai Mohith Potluri |
Trade-Offs in Dynamic Coloring for Bipartite and General Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(4), pp. 854-878, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Alberto Del Pia, Silvia Di Gregorio |
On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(8), pp. 2189-2213, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Shyan Akmal, Lijie Chen 0001, Ce Jin 0001, Malvika Raj, R. Ryan Williams |
Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(8), pp. 2395-2426, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Eyal Nussbaum, Michael Segal 0001, Oles Holembovskyy |
Finding Geometric Facilities with Location Privacy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(12), pp. 3572-3601, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Bruno Pasqualotto Cavalar, Zhenjian Lu |
Algorithms and Lower Bounds for Comparator Circuits from Shrinkage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(7), pp. 2131-2155, July 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Joshua Ani, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch |
Traversability, Reconfiguration, and Reachability in the Gadget Framework. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(11), pp. 3453-3486, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Ben Cameron, Joe Sawada, Wei Therese, Aaron Williams |
Hamiltonicity of k-Sided Pancake Networks with Fixed-Spin: Efficient Generation, Ranking, and Optimality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(3), pp. 717-744, March 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | François Le Gall, Saeed Seddighin |
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(5), pp. 1251-1286, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Patrizio Angelini, Michael A. Bekos, Henry Förster, Martin Gronemann |
Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(9), pp. 2667-2692, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Kangsan Kim, Yongho Shin, Hyung-Chan An |
Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location and k-Center. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(7), pp. 1883-1911, July 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Raghunath Reddy Madireddy, Apurva Mudgal |
A Constant-Factor Approximation Algorithm for Red-Blue Set Cover with Unit Disks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(1), pp. 100-132, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Leah Epstein, Loay Mualem |
Online Bin Packing of Squares and Cubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(5), pp. 1415-1458, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Robert Krauthgamer, Shay Sapir |
Comparison of Matrix Norm Sparsification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(12), pp. 3957-3972, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sumanta Banerjee, Juhi Chaudhary, Dinabandhu Pradhan |
Unique Response Roman Domination: Complexity and Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(12), pp. 3889-3927, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Deniz Agaoglu Çagirici, Petr Hlinený |
Efficient Isomorphism for Sd-Graphs and T-Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(2), pp. 352-383, February 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche |
Multistage s-t Path: Confronting Similarity with Dissimilarity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(7), pp. 2028-2064, July 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Arnold Filtser, Omrit Filtser, Matthew J. Katz |
Approximate Nearest Neighbor for Curves: Simple, Efficient, and Deterministic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(5), pp. 1490-1519, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sang Won Bae, Sang Duk Yoon |
Empty Squares in Arbitrary Orientation Among Points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(1), pp. 29-74, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Stefan Klootwijk, Bodo Manthey |
Probabilistic Analysis of Optimization Problems on Sparse Random Shortest Path Metrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(12), pp. 3793-3815, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Susanne Albers, Waldo Gálvez, Maximilian Janke |
Machine Covering in the Random-Order Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(6), pp. 1560-1585, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen |
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(9), pp. 2580-2604, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Jesse Beisegel, Ekkehard Köhler, Robert Scheffler 0001, Martin Strehler 0001 |
Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity of Threshold and Chain Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(8), pp. 2454-2481, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita |
Path Cover Problems with Length Cost. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(11), pp. 3348-3375, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sariel Har-Peled, Mitchell Jones |
Few Cuts Meet Many Point Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(4), pp. 965-975, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | David Eppstein |
A Stronger Lower Bound on Parametric Minimum Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(6), pp. 1738-1753, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Balagopal Komarath, Anurag Pandey 0001, Chengot Sankaramenon Rahul |
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(9), pp. 2554-2579, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Peter Kiss |
Deterministic Dynamic Matching in Worst-Case Update Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(12), pp. 3741-3765, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou |
An Improved Upper Bound on the Queue Number of Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(2), pp. 544-562, February 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Dmitriy S. Malyshev |
Combinatorics and Algorithms for Quasi-Chain Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(3), pp. 642-664, March 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Niccolò Di Marco, Andrea Frosini, William Lawrence Kocay, Elisa Pergola, Lama Tarsissi |
Structure and Complexity of 2-Intersection Graphs of 3-Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(3), pp. 745-761, March 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Ioana O. Bercea, Guy Even |
Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(6), pp. 1786-1804, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Philip N. Klein, Claire Mathieu, Hang Zhou 0001 |
Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(10), pp. 3024-3057, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore |
On Colorful Vertex and Edge Cover Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(12), pp. 3816-3827, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Félix Hernández, Gerardo Vega |
The Subfield and Extended Codes of a Subclass of Optimal Three-Weight Cyclic Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(12), pp. 3973-3995, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Shunhua Jiang, Bento Natura, Omri Weinstein |
A Faster Interior-Point Method for Sum-of-Squares Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(9), pp. 2843-2884, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Anselm Haak, Arne Meier, Om Prakash 0002, B. V. Raghavendra Rao |
Parameterised Counting in Logspace. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(10), pp. 2923-2961, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura |
Happy Set Problem on Subclasses of Co-comparability Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(11), pp. 3327-3347, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya |
Publisher Correction: Longest Common Substring with Approximately k Mismatches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(10), pp. 3323, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Joe Sawada, Aaron Williams |
Constructing the first (and coolest) fixed-content universal cycle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(6), pp. 1754-1785, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer |
Fair Allocation of Indivisible Items with Conflict Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(5), pp. 1459-1489, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani |
Upward Book Embeddability of st-Graphs: Complexity and Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(12), pp. 3521-3571, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Riccardo Dondi, Manuel Lafond |
On the Tractability of Covering a Graph with 2-Clubs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(4), pp. 992-1028, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Ivan Bliznets, Danil Sagunov |
Solving Target Set Selection with Bounded Thresholds Faster than 2n. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(2), pp. 384-405, February 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Tomohiro Koana, Christian Komusiewicz, Frank Sommer |
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(7), pp. 2156-2187, July 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol |
Double String Tandem Repeats. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(1), pp. 170-187, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Yossi Azar, Chay Machluf, Boaz Patt-Shamir, Noam Touitou |
Competitive Vertex Recoloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(7), pp. 2001-2027, July 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Meng He 0001, Anna Lubiw, Mohammad R. Salavatipour |
Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(6), pp. 1736-1737, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sayan Bandyapadhyay |
Improved Bounds for Metric Capacitated Covering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(7), pp. 1825-1849, July 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Alexander Birx, Yann Disser, Kevin Schewior |
Improved Bounds for Open Online Dial-a-Ride on the Line. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(5), pp. 1372-1414, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Shlomi Dolev, Thomas Petig, Elad Michael Schiller |
Self-Stabilizing and Private Distributed Shared Atomic Memory in Seldomly Fair Message Passing Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(1), pp. 216-276, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Hamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman |
Improved Algorithms for Scheduling Unsplittable Flows on Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(2), pp. 563-583, February 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Md. Saidur Rahman 0001, Petra Mutzel, Slamin |
Special Issue Dedicated to 16th International Conference and Workshops on Algorithms and Computation, WALCOM 2022. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(11), pp. 3325-3326, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Muhammad Faisal Nadeem, Hamza Iqbal, Hafiz Muhammad Afzal Siddiqui, Muhammad Azeem 0002 |
Intersecting Longest Cycles in Archimedean Tilings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(8), pp. 2348-2362, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Amey Bhangale, Aleksa Stankovic |
Max-3-Lin Over Non-abelian Groups with Universal Factor Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(9), pp. 2693-2734, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Matteo Castiglioni, Andrea Celli, Nicola Gatti 0001 |
Public Bayesian Persuasion: Being Almost Optimal and Almost Persuasive. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(9), pp. 2885-2921, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Spyros Angelopoulos 0001, Christoph Dürr, Shendan Jin |
Best-of-Both-Worlds Analysis of Online Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(12), pp. 3766-3792, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Pawel Gawrychowski, Przemyslaw Uznanski |
Better Distance Labeling for Unweighted Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(6), pp. 1805-1823, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz |
Composed Degree-Distance Realizations of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(3), pp. 665-687, March 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Gruia Calinescu, Xiaolang Wang |
Combination Algorithms for Steiner Tree Variants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(1), pp. 153-169, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Bellitto, Shaohua Li 0005, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge |
The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(5), pp. 1202-1250, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Yoann Dieudonné, Andrzej Pelc, Franck Petit |
Almost Universal Anonymous Rendezvous in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(10), pp. 3110-3143, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Amit Deshpande 0001, Rameshwar Pratap |
One-Pass Additive-Error Subset Selection for ℓ p Subspace Approximation and (k, p)-Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(10), pp. 3144-3167, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Andrea Marino 0001, Ana Silva 0001 |
Eulerian Walks in Temporal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(3), pp. 805-830, March 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Max A. Deppert, Klaus Jansen, Arindam Khan 0001, Malin Rau, Malte Tutas |
Peak Demand Minimization via Sliced Strip Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(12), pp. 3649-3679, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sándor P. Fekete, Jonas Grosse-Holz, Phillip Keldenich, Arne Schmidt 0001 |
Parallel Online Algorithms for the Bin Packing Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(1), pp. 296-323, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Guilherme C. M. Gomes, Matheus R. Guedes, Vinícius Fernandes dos Santos |
Structural Parameterizations for Equitable Coloring: Complexity, FPT Algorithms, and Kernelization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(7), pp. 1912-1947, July 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Vincent Froese, Brijnesh J. Jain, Maciej Rymar, Mathias Weller |
Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(2), pp. 492-508, February 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, Maciej Obremski |
Algebraic Restriction Codes and Their Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(12), pp. 3602-3648, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Alberto Rojas Anríquez, Maya Stein |
3-Colouring Pt-Free Graphs Without Short Odd Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(4), pp. 831-853, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Serge Gaspers, Edward J. Lee |
Faster Graph Coloring in Polynomial Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(2), pp. 584-609, February 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Joyce Bacic, Saeed Mehrabi 0001, Michiel Smid |
Shortest Beer Path Queries in Outerplanar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(6), pp. 1679-1705, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | David Caballero, Timothy Gomez, Robert T. Schweller, Tim Wylie |
Unique Assembly Verification in Two-Handed Self-Assembly. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(8), pp. 2427-2453, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Moran Feldman, Zeev Nutov, Elad Shoham |
Practical Budgeted Submodular Maximization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(5), pp. 1332-1371, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Konstantinos Tsakalidis, Sebastian Wild, Viktor Zamaraev |
Succinct Permutation Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(2), pp. 509-543, February 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous |
Clique-Based Separators for Geometric Intersection Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(6), pp. 1652-1678, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Herbert Edelsbrunner, Georg Osang |
A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(1), pp. 277-295, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf |
Non-Preemptive Tree Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(3), pp. 783-804, March 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Júlio Araújo 0001, Marin Bougeret, Victor A. Campos, Ignasi Sau |
Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(2), pp. 444-491, February 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Waldo Gálvez, Fabrizio Grandoni 0001, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan 0001, Malin Rau |
A Tight (3/2+ε )-Approximation for Skewed Strip Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(10), pp. 3088-3109, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Tomohiro Koana, Christian Komusiewicz, Frank Sommer |
Essentially Tight Kernels for (Weakly) Closed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(6), pp. 1706-1735, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sebastian Forster, Tijn de Vos |
Faster Cut Sparsification of Weighted Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(4), pp. 929-964, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Mincheol Kim, Chanyang Seo, Taehoon Ahn 0001, Hee-Kap Ahn |
Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(8), pp. 2214-2237, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis |
MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(9), pp. 2817-2842, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Yishu Wang 0002, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri |
A General Framework for Enumerating Equivalence Classes of Solutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(10), pp. 3003-3023, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen |
Algorithms and Complexity on Indexing Founder Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(6), pp. 1586-1623, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Miroslaw Kowaluk, Andrzej Lingas |
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(4), pp. 976-991, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Yiqin Gao, Yves Robert, Frédéric Vivien |
Resource-Constrained Scheduling Algorithms for Stochastic Independent Tasks With Unknown Probability Distribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(8), pp. 2363-2394, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Akanksha Agrawal 0001, Pranabendu Misra, Fahad Panolan, Saket Saurabh 0001 |
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(9), pp. 2622-2641, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Arnold Filtser, Ofer Neiman |
Light Spanners for High Dimensional Norms via Stochastic Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(10), pp. 2987-3007, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Stefano Leucci 0001, Chih-Hung Liu 0001 |
Approximate Minimum Selection with Unreliable Comparisons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(1), pp. 60-84, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Petr A. Golovach, Meirav Zehavi |
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(11), pp. 3107-3109, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Gabriel Bathie, Nicolas Bousquet, Yixin Cao 0001, Yuping Ke, Théo Pierron |
(Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(11), pp. 3338-3364, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|