| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Jonathan Klawitter, Johannes Zink 0001 |
Upward Planar Drawings with Three and More Slopes.  |
J. Graph Algorithms Appl.  |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcus Schaefer 0001 |
The Complexity of Angular Resolution. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Katharina T. Huber, Vincent Moulton, Andreas Spillner 0001 |
Computing consensus networks for collections of 1-nested phylogenetic networks. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Elena Arseneva, Rahul Gangopadhyay, Aleksandra Istomina |
Morphing tree drawings in a small 3D grid. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | R. Sundara Rajan, A. Berin Greeni, P. Leo Joshwa |
Minimum Linear Arrangement of Generalized Sierpinski Graphs. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Philipp Kindermann, Jan Sauer, Alexander Wolff 0001 |
The Computational Complexity of the ChordLink Model. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrizio Angelini, Reinhard von Hanxleden |
Guest Editors' Foreword. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Mathieu Jacomy |
Connected-closeness: A Visual Quantification of Distances in Network Layouts. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeff Erickson 0001, Patrick Lin 0001 |
Planar and Toroidal Morphs Made Easier. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcus Schaefer 0001 |
RAC-Drawability is ∃ℝ-complete and Related Results. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos |
Improved (In-)Approximability Bounds for d-Scattered Set. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid |
The Minimum Moving Spanning Tree Problem. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ignaz Rutter, Helen C. Purchase |
Guest Editors' Foreword. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Walter Didimo, Michael Kaufmann 0001, Giuseppe Liotta, Giacomo Ortali |
Rectilinear Planarity of Partial 2-Trees. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominik Dürrschnabel, Tom Hanika, Gerd Stumme |
Drawing Order Diagrams Through Two-Dimension Extension. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Chimani, Max Ilsen, Tilo Wiedera |
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sabine Cornelsen, Gregor Diatzko |
Planar Confluent Orthogonal Drawings of 4-Modal Digraphs. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Vasileios Geladaris, Panagiotis Lionakis, Ioannis G. Tollis |
Effective Computation of a Feedback Arc Set Using PageRank. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Simard, Clémence Magnien, Matthieu Latapy |
Computing Betweenness Centrality in Link Streams. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Alane M. de Lima, Murilo V. G. da Silva, André Luís Vignatti |
A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier |
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf 0002 |
Order Reconfiguration under Width Constraints. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Alfredo García, Javier Tejel, Birgit Vogtenhuber, Alexandra Weinberger |
Empty Triangles in Generalized Twisted Drawings of $K_n$. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Carla Binucci, Walter Didimo, Maurizio Patrignani |
$st$-Orientations with Few Transitive Edges. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca Calderoni, Luciano Margara, Moreno Marzolla |
A Heuristic for Direct Product Graph Decomposition. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Chaplick, Krzysztof Fleszar 0001, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky 0001, Alexander Wolff 0001 |
The Complexity of Drawing Graphs on Few Lines and Few Planes. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sean Cleary |
Restricted rotation distance between k-ary trees. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Giuseppe Di Battista, Walter Didimo, Luca Grilli 0001, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, Alessandra Tappini |
Small Point-Sets Supporting Graph Stories. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Chimani, Petr Hlinený |
Inserting Multiple Edges into a Planar Graph. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan Arroyo, Stefan Felsner |
Approximating the Bundled Crossing Number. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Giordano Da Lozzo, Philipp Kindermann |
Guest Editors' Foreword. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Md. Saidur Rahman 0001, Petra Mutzel, S. Slamin 0001 |
Guest Editors' forewords. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | David R. Wood |
2-Layer Graph Drawings with Bounded Pathwidth. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Andrea Lincoln, Virginia Vassilevska Williams |
Quasipolynomiality of the Smallest Missing Induced Subgraph. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahnuma Islam Nishat, Venkatesh Srinivasan 0001, Sue Whitesides |
1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder |
Simplifying Non-Simple Fan-Planar Drawings. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sarah Carmesin, André Schulz 0001 |
Arrangements of orthogonal circles with many intersections. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Craig Gotsman, Kai Hormann |
Efficient Point-to-Point Resistance Distance Queries in Large Graphs. |
J. Graph Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Mark Keil, Debajyoti Mondal, Ehsan Moradi, Yakov Nekrich |
Finding a Maximum Clique in a Grounded 1-Bend String Graph. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Leon Kellerhals, Tomohiro Koana |
Parameterized Complexity of Geodetic Set. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas C. Hull, Manuel Morales, Sarah Nash, Natalya Ter-Saakov |
Maximal origami flip graphs of flat-foldable vertices: properties and algorithms. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sabine Cornelsen, Maximilian Pfister 0002, Henry Förster, Martin Gronemann, Michael Hoffmann 0001, Stephen G. Kobourov, Thomas Schneck |
Drawing Shortest Paths in Geodetic Graphs. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ahmad Biniaz |
Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Eranda Çela, Elisabeth Gaar |
Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Hossein Boomari, Alireza Zarei |
Visibility Graphs of Anchor Polygons. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathan van Beusekom, Irene Parada, Bettina Speckmann |
Crossing Numbers of Beyond-Planar Graphs Revisited. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg |
Parameterized Algorithms for Queue Layouts. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Darcy Best, Max Ward 0001 |
A faster algorithm for maximum independent set on interval filament graphs. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Felsner, Michael Hoffmann 0001, Kristin Knorr, Jan Kyncl, Irene Parada |
On the Maximum Number of Crossings in Star-Simple Drawings of $K_n$ with No Empty Lens. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Seok-Hee Hong 0001, Subhas C. Nandy, Ryuhei Uehara |
Guest Editors' Foreword. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein 0001, Maurizio Patrignani, Ignaz Rutter |
On Turn-Regular Orthogonal Representations. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Mahdi Belbasi, Martin Fürer |
An Improvement of Reed's Treewidth Approximation. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, Birgit Vogtenhuber |
On Compatible Matchings. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Mareike Fischer 0001, Michelle Galla, Kristina Wicke |
Non-binary universal tree-based networks. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Lubiw, Tillmann Miltzow, Debajyoti Mondal |
The Complexity of Drawing a Graph in a Polygonal Region. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcus Schäfer 0001, Daniel Stefankovic |
The Degenerate Crossing Number and Higher-Genus Embeddings. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Alon Efrat, Radoslav Fulek, Stephen G. Kobourov, Csaba D. Tóth |
Polygons with Prescribed Angles in 2D and 3D. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Giuseppe Liotta |
Editor in Chief's Foreword. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono 0001 |
Computing L(p, 1)-Labeling with Combined Parameters. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan Klawitter, Tamara Mchedlidze |
Upward planar drawings with two slopes. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Vahan Mkrtchyan, Garik Petrosyan |
On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Lorenzo Balzotti, Paolo Giulio Franciosa |
Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Shijun Cai, Seok-Hee Hong 0001, Jialiang Shen, Tongliang Liu |
A Machine Learning Approach for Predicting Human Preference for Graph Layouts. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo |
Planar L-Drawings of Bimodal Graphs. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ahmad Biniaz |
A short proof of the non-biplanarity of $K_9$. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Drago Bokal, Markus Chimani, Alexander Nover, Jöran Schierbaum, Tobias Stolzmann, Mirko H. Wagner, Tilo Wiedera |
Properties of Large 2-Crossing-Critical Graphs. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Fenner, Daniel Grier, Rohit Gurjar, Arpita Korwar, Thomas Thierauf |
The Complexity of Poset Games. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Therese Biedl, Milap Sheth |
Drawing Halin-graphs with small height. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | David A. Bader, Paul Burkhardt |
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Therese Biedl |
Drawing outer-1-planar graphs revisited. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier |
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcus Schaefer 0001 |
Complexity of Geometric k-Planarity for Fixed k. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Mareike Fischer 0001, Volkmar Liebscher |
On the Balance of Unrooted Trees. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong 0001, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath |
Packing Trees into 1-planar Graphs. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Bentert, Mathias Weller |
Tree Containment With Soft Polytomies. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt |
Circumference of essentially 4-connected planar triangulations. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcus Schaefer 0001 |
On the Complexity of Some Geometric Problems With Fixed Parameters. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Altansuren Tumurbaatar, Matthew J. Sottile |
Algebraic Algorithms for Betweenness and Percolation Centrality. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Brown, Trevor I. Fenner |
Fast Generation of Unlabelled Free Trees using Weight Sequences. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Vicente Acuña, Leandro Ishi Soares de Lima, Giuseppe F. Italiano, Luca Pepè Sciarria, Marie-France Sagot, Blerina Sinaimeri |
A family of tree-based generators for bubbles in directed graphs. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Marco Tais |
Schematic Representation of Large Biconnected Graphs. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Ming-Hsuan Kang, Wu-Hsiung Lin |
Equilateral Spherical Drawings of Planar Cayley Graphs. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Hertz |
Decycling bipartite graphs. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | David Schaller 0001, Manuela Geiß, Marc Hellmuth, Peter F. Stadler |
Least resolved trees for two-colored best match graphs. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg |
On Strict (Outer-)Confluent Graphs. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Guido Brückner, Ignaz Rutter |
Radial Level Planarity with Fixed Embedding. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Lukas Barth, Guido Brückner, Paul Jungeblut, Marcel Radermacher |
Multilevel Planarity. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrizio Angelini, Ignaz Rutter, T. P. Sandhya 0001 |
Extending Partial Orthogonal Drawings. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Remie Janssen |
Heading in the right direction? Using head moves to traverse phylogenetic network space. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Gyula Pap, József Varnyú |
Synchronized Traveling Salesman Problem. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz 0001 |
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Kaufmann 0001, János Pach, Géza Tóth 0001, Torsten Ueckerdt |
The number of crossings in multigraphs with no empty lens. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | John M. Boyer |
Revising the Fellows-Kaschube $K_{3, 3}$ Search. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | William S. Evans, Stefan Felsner, Linda Kleist, Stephen G. Kobourov |
On Area-Universal Quadrangulations. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | M. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung |
Guest editors' foreword. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | William S. Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff 0001 |
Angle Covers: Algorithms and Complexity. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Espen Slettnes |
Minimal Embedding Dimensions of Rectangle k-Visibility Graphs. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | A. Arul Shantrinal, Sandi Klavzar, T. M. Rajalaxmi, R. Sundara Rajan |
An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein |
Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Vida Dujmovic, Pat Morin, Céline Yelle |
Two Results on Layered Pathwidth and Linear Layouts. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license