The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

URL (DBLP): http://dblp.uni-trier.de/db/conf/icse

Publication years (Num. hits)
1989 (50) 1991 (44) 1993 (58) 1995 (46) 1997 (43) 1999 (36) 2001 (44) 2002-2003 (74) 2004 (17) 2005 (40) 2006 (18) 2007 (72) 2008-2009 (78) 2010-2011 (63)
Publication types (Num. hits)
inproceedings(664) proceedings(19)
Venues (Conferences, Journals, ...)
WADS(683)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 121 occurrences of 104 keywords

Results
Found 683 publication records. Showing 683 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Boris Aronov, Muriel Dulieu How to Cover a Point Set with a V-Shape of Minimum Width. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Tim Nonner PTAS for Densest k-Subgraph in Interval Graphs. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella On the Area Requirements of Euclidean Minimum Spanning Trees. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Yahav Nussbaum Improved Distance Queries in Planar Graphs. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Beat Gfeller Finding Longest Approximate Periodic Patterns. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jie Gao, Dengpan Zhou Resilient and Low Stretch Routing through Embedding into Tree Metrics. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Tobias Christ Beyond Triangulation: Covering Polygons with Triangles. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1János Pach, Gábor Tardos Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Robert Endre Tarjan Theory vs. Practice in the Design and Analysis of Algorithms. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michael L. Fredman On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Brent Heeringa, Marius Catalin Iordan, Louis Theran Searching in Dynamic Tree-Like Partial Orders. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Nikhil R. Devanur, Uriel Feige An O(n log n) Algorithm for a Load Balancing Problem on Paths. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Mohammad Ali Abam, Mark de Berg, Amirali Khosravi Piecewise-Linear Approximations of Uncertain Functions. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Gruia Calinescu, Minming Li Register Loading via Linear Programming. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Zhou Xu, Xiaofan Lai A Fully Polynomial Approximation Scheme for a Knapsack Problem with a Minimum Filling Constraint. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Danny Z. Chen, Haitao Wang New Algorithms for 1-D Facility Location and Path Equipartition Problems. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1David Eppstein, Michael T. Goodrich, Maarten Löffler Tracking Moving Objects with Few Handovers. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jaikumar Radhakrishnan, Saswata Shannigrahi Streaming Algorithms for 2-Coloring Uniform Hypergraphs. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Anne Driemel, Herman J. Haverkort, Maarten Löffler, Rodrigo I. Silveira Flow Computations on Imprecise Terrains. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira Adjacency-Preserving Spatial Treemaps. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Peter Damaschke, Leonid Molokov Parameterized Reductions and Algorithms for Another Vertex Cover Generalization. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Caio Dias Valentim Binary Identification Problems for Weighted Trees. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Meng He, J. Ian Munro Space Efficient Data Structures for Dynamic Orthogonal Range Counting. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Mark de Berg, Amirali Khosravi, Sander Verdonschot, Vincent van der Weele On Rectilinear Partitions with Minimum Stabbing Number. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1David G. Kirkpatrick, Sandra Zilles Competitive Search in Symmetric Trees. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Christof Doll, Tanja Hartmann, Dorothea Wagner Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Shoshana Neuburger, Dina Sokol Succinct 2D Dictionary Matching with No Slowdown. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Boris Aronov, Muriel Dulieu, Ferran Hurtado Witness Rectangle Graphs. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl Counting Plane Graphs: Flippability and Its Applications. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Frank Dehne, John Iacono, Jörg-Rüdiger Sack (eds.) Algorithms and Data Structures - 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor Frequency Capping in Online Advertising. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Evangelos Kranakis, Oscar Morales Ponce, Jukka Suomela Planar Subgraphs without Low-Degree Nodes. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter Consistent Labeling of Rotating Maps. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Spyros Angelopoulos, Alejandro López-Ortiz, Konstantinos Panagiotou Multi-target Ray Searching Problems. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Kyle Fox Upper Bounds for Maximally Greedy Binary Search Trees. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Therese C. Biedl, Stephane Durocher, Céline Engelbeen, Samuel Fiorini, Maxwell Young Faster Optimal Algorithms for Segment Minimization with Small Maximal Value. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Johannes Fischer Inducing the LCP-Array. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Philip N. Klein, Shay Mozes Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Shay Solomon The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Sarah Eisenstat Flattening Fixed-Angle Chains Is Strongly NP-Hard. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Robert Görke, Andrea Schumm, Dorothea Wagner Density-Constrained Graph Clustering. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Paul Christiano, Erik D. Demaine, Shaunak Kishore Lossless Fault-Tolerant Data Structures with Additive Overhead. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Venkatesh Srinivasan, Ulrike Stege, Sue Whitesides Connecting a Set of Circles with Minimum Sum of Radii. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Timothy M. Chan, Vinayak Pathak Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Atlas F. Cook, Anne Driemel, Sariel Har-Peled, Jessica Sherette, Carola Wenk Computing the Fréchet Distance between Folded Polygons. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1P. Thomas Fletcher, John Moeller, Jeff M. Phillips, Suresh Venkatasubramanian Horoball Hulls and Extents in Positive Definite Space. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Markus Bläser, Bodo Manthey, B. V. Raghavendra Rao Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Allan Jørgensen, Maarten Löffler, Jeff M. Phillips Geometric Computations on Indecisive Points. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee A (5/3 + ε)-Approximation for Strip Packing. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Pegah Kamousi, Timothy M. Chan, Subhash Suri Closest Pair and the Post Office Problem for Stochastic Points. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Yaw-Ling Lin, Charles B. Ward, Bharat Jain, Steven Skiena Constructing Orthogonal de Bruijn Sequences. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Yakov Nekrich A Fast Algorithm for Three-Dimensional Layers of Maxima Problem. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Valentin Polishchuk, Mikko Sysikaski Faster Algorithms for Minimum-Link Paths with Restricted Orientations. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jing He, Hongyu Liang, Guang Yang Reversing Longest Previous Factor Tables is Hard. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Paul Bonsma, Daniel Lokshtanov Feedback Vertex Set in Mixed Graphs. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao Path Minima Queries in Dynamic Weighted Trees. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Therese C. Biedl, Lesvia Elena Ruiz Velázquez Orthogonal Cartograms with Few Corners Per Face. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jianer Chen, Jia-Hao Fan, Iyad A. Kanj, Yang Liu, Fenghui Zhang Multicut in Trees Viewed through the Eyes of Vertex Cover. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger Enumerating Minimal Subset Feedback Vertex Sets. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Abhijin Adiga, Jasine Babu, L. Sunil Chandran A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, Shang Yang Convex Transversals. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Antonio Casimiro, Rogério de Lemos, Cristina Gacek (eds.) Architecting Dependable Systems VII Search on Bibsonomy WADS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Robert Görke, Tanja Hartmann, Dorothea Wagner Dynamic Graph Clustering Using Minimum-Cut Trees. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Gerth Stølting Brodal, Allan Grønlund Jørgensen, Thomas Mølhave Fault Tolerant External Memory Algorithms. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Matthew J. Katz, Gila Morgenstern A Scheme for Computing Minimum Covers within Simple Regions. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine Algorithms Meet Art, Puzzles, and Magic. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Patrizio Angelini, Fabrizio Frati, Michael Kaufmann Straight-Line Rectangular Drawings of Clustered Graphs. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski Approximation Algorithms for Buy-at-Bulk Geometric Network Design. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Wenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1David Eppstein, Elena Mumford Orientation-Constrained Rectangular Layouts. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Sándor P. Fekete, Tom Kamphans, Nils Schweer Online Square Packing. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1David L. Millman, Jack Snoeyink Computing the Implicit Voronoi Diagram in Triple Precision. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Low-degree primitives, Robust computation, Randomized algorithm, Voronoi diagram
1Adrian Dumitrescu, Minghui Jiang On Reconfiguration of Disks in the Plane and Related Problems. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Spyros Angelopoulos Online Priority Steiner Tree Problems. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Chenyu Yan, Yang Xiang, Feodor F. Dragan Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1David Eppstein, Emma S. Spiro The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1James B. Orlin, Abraham P. Punnen, Andreas S. Schulz Integer Programming: Optimization and Evaluation Are Equivalent. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Brad Ballinger, David Charlton, Erik D. Demaine, Martin L. Demaine, John Iacono, Ching-Hao Liu, Sheung-Hung Poon Minimal Locked Trees. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Piotr Berman, Bhaskar DasGupta, Marek Karpinski Approximating Transitive Reductions for Directed Networks. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Farzad Hassanzadeh, David Rappaport Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Intersecting Polygon, Approximation Algorithm, Computational Geometry, Line Segment
1Travis Gagie, Yakov Nekrich Worst-Case Optimal Adaptive Prefix Coding. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Daniel M. Kane, Gregory N. Price, Erik D. Demaine A Pseudopolynomial Algorithm for Alexandrov's Theorem. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter Rote, Bettina Speckmann, Birgit Vogtenhuber Plane Graphs with Parity Constraints. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Frank K. H. A. Dehne, Marina L. Gavrilova, Jörg-Rüdiger Sack, Csaba D. Tóth (eds.) Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Takehiro Ito, Marcin Kaminski, Erik D. Demaine Reconfiguration of List Edge-Colorings in a Graph. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Joan Boyar, Sandy Irani, Kim S. Larsen A Comparison of Performance Measures for Online Algorithms. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Boris Aronov, Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira, Bettina Speckmann Connect the Dot: Computing Feed-Links with Minimum Dilation. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Prosenjit Bose, Karim Douïeb Efficient Construction of Near-Optimal Binary and Multiway Search Trees. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Christiane Lammersen, Anastasios Sidiropoulos, Christian Sohler Streaming Embeddings with Slack. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Martin Knauer, Joachim Spoerhase Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Prosenjit Bose, John Howat, Pat Morin A Distribution-Sensitive Dictionary with Low Space Overhead. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jonathan Derryberry, Daniel Dominic Sleator Skip-Splay: Toward Achieving the Unified Bound in the BST Model. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Prosenjit Bose, Meng He, Anil Maheshwari, Pat Morin Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Alexander Gilbers, Rolf Klein New Results on Visibility in Simple Polygons. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Computational geometry, visibility, VC-dimension, art galleries, guards
1Jianer Chen, Yang Liu 0002 An Improved SAT Algorithm in Terms of Formula Length. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Klaus Jansen, Lars Prädel, Ulrich M. Schwarz Two for One: Tight Approximation of 2D Bin Packing. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF approximation, bin packing, rectangle packing
1Kevin Buchin, Maarten Löffler, Pat Morin, Wolfgang Mulzer Delaunay Triangulation of Imprecise Points Simplified and Extended. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Günter Rote, André Schulz Resolving Loads with Positive Interior Stresses. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 683 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.