| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong |
Approximately Coloring Graphs Without Long Induced Paths.  |
Algorithmica  |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Duc-Cuong Dang, Per Kristian Lehre, Phan Trung Hai Nguyen |
Level-Based Analysis of the Univariate Marginal Distribution Algorithm. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna |
Cutwidth: Obstructions and Algorithmic Aspects. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Bury, Elena Grigorescu, Andrew McGregor 0001, Morteza Monemizadeh, Chris Schwiegelshohn, Sofya Vorotnikova, Samson Zhou |
Structural Results on Matching Estimation with Applications to Streaming. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, Benny Porat |
Can We Recover the Cover? |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi 0001, Fabrizio Montecchiani, Hamideh Vosoughpour, Ziting Yu |
Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrizio Angelini, Michael A. Bekos |
Hierarchical Partial Planarity. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Barba, Malte Milatz, Jerri Nummenpalo, Xiaoming Sun 0001, Antonis Thomas, Jialin Zhang 0001, Zhijie Zhang |
The Complexity of Optimization on Grids. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Ignaz Rutter, Alessandra Tappini |
NodeTrix Planarity Testing with Small Clusters. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | George B. Mertzios, Othon Michail, Paul G. Spirakis |
Temporal Network Optimization Subject to Connectivity Constraints. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, José A. Soto |
LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani 0001, Piotr Wojciechowski 0002 |
A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Cornelius Brand, Holger Dell, Marc Roth |
Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Cecilia Bohler, Rolf Klein, Chih-Hung Liu 0001 |
An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Niv Buchbinder, Danny Segev, Yevgeny Tkach |
Online Algorithms for Maximum Cardinality Matching with Edge Arrivals. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Lech Duraj, Marvin Künnemann, Adam Polak 0001 |
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Tsuyoshi Ito, Stacey Jeffery |
Approximate Span Programs. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Shaojiang Wang, Kun He 0011, Yicheng Pan 0001, Mingji Xia |
Rectangle Transformation Problem. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Dirk Sudholt, Carsten Witt |
On the Choice of the Update Strength in Estimation-of-Distribution Algorithms and Ant Colony Optimization. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Witt |
Upper Bounds on the Running Time of the Univariate Marginal Distribution Algorithm on OneMax. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Pietro Cenciarelli, Daniele Gorla, Ivano Salvo |
A Polynomial-Time Algorithm for Detecting the Possibility of Braess Paradox in Directed Graphs. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis |
Binary Search in Graphs Revisited. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Samadhi Nallaperuma, Pietro S. Oliveto, Jorge Pérez Heredia, Dirk Sudholt |
On the Analysis of Trajectory-Based Search Algorithms: When is it Beneficial to Reject Improvements? |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Spyros Angelopoulos 0001, Reza Dorrigiv, Alejandro López-Ortiz |
On the Separation and Equivalence of Paging Strategies and Other Online Algorithms. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | R. Krithika 0001, Abhishek Sahu, Saket Saurabh 0001, Meirav Zehavi |
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Hoàng-Oanh Le, Van Bang Le |
Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx |
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomasz Kociumaka, Marcin Pilipczuk |
Deleting Vertices to Graphs of Bounded Genus. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Carmel, Dekel Tsur, Michal Ziv-Ukelson |
On Almost Monge All Scores Matrices. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Z. Chen, Haitao Wang 0001 |
Computing L1 Shortest Paths Among Polygonal Obstacles in the Plane. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiong Guo, Danny Hermelin |
Foreword: Special Issue on Parameterized and Exact Computation. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Christian Gießen, Carsten Witt, Jing Yang 0016 |
The (1+λ) Evolutionary Algorithm with Self-Adjusting Mutation Rate. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Ziyun Huang, Hu Ding, Jinhui Xu 0001 |
A Faster Algorithm for Truth Discovery via Range Cover. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna |
Edge Bipartization Faster than $$2^k$$ 2 k. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Franz J. Brandenburg |
Characterizing and Recognizing 4-Map Graphs. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Ben-Basat, Gil Einziger, Roy Friedman, Yaron Kassner |
Succinct Summing over Sliding Windows. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi 0001, Yoshio Okamoto |
Minimum-Cost b-Edge Dominating Sets on Trees. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmitriy Katz, Baruch Schieber, Hadas Shachnai |
Flexible Resource Allocation to Interval Jobs. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrizio Angelini, Michael A. Bekos, Giuseppe Liotta, Fabrizio Montecchiani |
Universal Slope Sets for 1-Bend Planar Drawings. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Oded Lachish, Yadu Vasudev |
Improving and Extending the Testing of Distributions for Shape-Restricted Properties. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Stanley P. Y. Fung |
Optimal Online Two-Way Trading with Bounded Number of Transactions. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Cédric Bentz |
An FPT Algorithm for Planar Multicuts with Sources and Sinks on the Outer Face. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Björklund, Petteri Kaski, Ryan Williams 0001 |
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Megha Khosla, Avishek Anand |
A Faster Algorithm for Cuckoo Insertion and Bipartite Matching in Large Graphs. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Klavík, Yota Otachi, Jirí Sejnoha |
On the Classes of Interval Graphs of Limited Nesting and Count of Lengths. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Geevarghese Philip, Varun Rajan, Saket Saurabh 0001, Prafullkumar Tale |
Subset Feedback Vertex Set in Chordal and Split Graphs. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Pratish Datta, Ratna Dutta, Sourav Mukhopadhyay |
Constrained Pseudorandom Functions for Turing Machines Revisited: How to Achieve Verifiability and Key Delegation. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph S. B. Mitchell, Valentin Polishchuk, Mikko Sysikaski, Haitao Wang 0001 |
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Feng Shi 0003, Martin Schirneck, Tobias Friedrich 0001, Timo Kötzing, Frank Neumann 0001 |
Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Eleftherios Anastasiadis, Xiaotie Deng, Piotr Krysta, Minming Li, Han Qiao, Jinshan Zhang 0001 |
Network Pollution Games. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Krysta, David F. Manlove, Baharak Rastegari, Jinshan Zhang 0001 |
Size Versus Truthfulness in the House Allocation Problem. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Marvin Künnemann, Daniel Moeller, Ramamohan Paturi, Stefan Schneider 0003 |
Subquadratic Algorithms for Succinct Stable Matching. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa 0001 |
Parameterized Complexity of Asynchronous Border Minimization. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Emil Feldmann |
Fixed-Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Chao Qian 0001, Chao Bian 0002, Wu Jiang, Ke Tang 0001 |
Running Time Analysis of the ( $$1+1$$ 1 + 1 )-EA for OneMax and LeadingOnes Under Bit-Wise Noise. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Maier, Peter Sanders 0001, Stefan Walzer |
Dynamic Space Efficient Hashing. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier |
A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas |
A Fixed-Parameter Perspective on #BIS. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Keerti Choudhary, Liam Roditty |
An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot |
On Plane Constrained Bounded-Degree Spanners. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhi-Zhong Chen, Guohui Lin, Lusheng Wang 0001, Yong Chen 0002, Dan Wang |
Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul 0001, M. S. Ramanujan 0001 |
On the Complexity Landscape of Connected f-Factor Problems. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Guru Prakash Arumugam, John Augustine, Mordecai J. Golin, Prashanth Srikanthan |
Minmax Regret k-Sink Location on a Dynamic Path Network with Uniform Capacities. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova |
The Power and Limitations of Uniform Samples in Testing Properties of Figures. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Mong-Jen Kao, Hai-Lun Tu, D. T. Lee |
O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Peng Zhang 0008, Yao Xu, Tao Jiang 0001, Angsheng Li, Guohui Lin, Eiji Miyano |
Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Faisal N. Abu-Khzam, Cristina Bazgan, Katrin Casel, Henning Fernau |
Clustering with Lower-Bounded Sizes - A General Graph-Theoretic Framework. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel Fiorini, R. Krithika 0001, N. S. Narayanaswamy, Venkatesh Raman 0001 |
Approximability of Clique Transversal in Perfect Graphs. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Zhihan Gao 0002 |
Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part II. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu 0001 |
On (1,ϵ)-Restricted Max-Min Fair Allocation Problem. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles |
The Fast Search Number of a Complete k-Partite Graph. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer |
Path Refinement in Weighted Regions. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Kamal Al-Bawani, Matthias Englert, Matthias Westermann |
Comparison-Based Buffer Management in QoS Switches. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Faigle, Walter Kern, Britta Peis |
Greedy Oriented Flows. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Farbstein, Asaf Levin |
Discounted Reward TSP. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Gießen, Carsten Witt |
Optimal Mutation Rates for the (1+λ) EA on OneMax Through Asymptotically Tight Drift Analysis. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Aparna Das, Krzysztof Fleszar 0001, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff 0001 |
Approximating the Generalized Minimum Manhattan Network Problem. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Daniel S. Hirschberg |
From Discrepancy to Majority. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Donglei Du, Dachuan Xu |
Editorial: Special Issue on Computing and Combinatorics. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Reitzig, Sebastian Wild |
Building Fences Straight and High: An Optimal Algorithm for Finding the Maximum Length You Can Cut k Times from Given Sticks. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Alice Paul, Matthias Poloczek, David P. Williamson |
Simple Approximation Algorithms for Balanced MAX 2SAT. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid |
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Aritra Banik, Fahad Panolan, Venkatesh Raman 0001, Vibha Sahlot |
Fréchet Distance Between a Line and Avatar Point Set. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnus Bordewich, Charles Semple, Nihan Tokac |
Constructing Tree-Child Networks from Distance Matrices. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Fischer 0001, Tomohiro I, Dominik Köppl, Kunihiko Sadakane |
Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Carola Doerr |
Optimal Static and Self-Adjusting Parameter Choices for the (1+(λ, λ)) Genetic Algorithm. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Kevin P. Costello |
Faster Information Gathering in Ad-Hoc Radio Tree Networks. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Abram Magner, Wojciech Szpankowski |
Profiles of PATRICIA Tries. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama |
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Editor's Note. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Bert Besser, Matthias Poloczek |
Erratum to: Greedy Matching: Guarantees and Limitations. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Etscheid, Matthias Mnich |
Linear Kernels and Linear-Time Algorithms for Finding Large Cuts. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Carl Barton, Solon P. Pissis |
Crochemore's Partitioning on Weighted Strings and Applications. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Zahed Rahmati, Timothy M. Chan |
A Clustering-Based Approach to Kinetic Closest Pair. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Yasushi Kawase, Kazuhisa Makino, Kento Seimi |
Optimal Composition Ordering Problems for Piecewise Linear Functions. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | George Christodoulou 0001, Alkmini Sgouritsa, Bo Tang 0010 |
On the Efficiency of All-Pay Mechanisms. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Rémy Belmonte, Yota Otachi, Pascal Schweitzer |
Induced Minor Free Graphs: Isomorphism and Clique-Width. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Lars Nagel 0001, Chris Wastell |
Self-Stabilizing Balls and Bins in Batches - The Power of Leaky Bins. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Facundo Mémoli, Anastasios Sidiropoulos, Vijay Sridhar |
Quasimetric Embeddings and Their Applications. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Leo van Iersel, Steven Kelk, Georgios Stamoulis, Leen Stougie, Olivier Boes |
On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license