The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "Discrete Applied Mathematics"( http://dblp.L3S.de/Venues/Discrete_Applied_Mathematics )

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

Publication years (Num. hits)
1988 (60) 1989 (83) 1990 (93) 1991 (105) 1992 (142) 1993 (152) 1994 (177) 1995 (173) 1996 (149) 1997 (189) 1998 (167) 1999 (162) 2000 (153) 2001 (164) 2002 (170) 2003 (255) 2004 (269) 2005 (180) 2006 (223) 2007 (237) 2008 (310) 2009 (377) 2010 (228) 2011 (232) 2012 (38)
Publication types (Num. hits)
article(4488)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 4488 publication records. Showing 4488 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1A. Bellanger, Adam Janiak, Mikhail Y. Kovalyov, Ammar Oulamara Scheduling an unbounded batching machine with job processing time compatibilities. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann On Bounded-Degree Vertex Deletion parameterized by treewidth. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Daniel K. Benvenuti, Abraham P. Punnen Three value TSP and linkages with the three value linear spanning 2-forests. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Zhou Xu, Dongsheng Xu, Wenbin Zhu Approximation results for a min-max location-routing problem. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Amir Daneshgar, Ramin Javadi On the complexity of isoperimetric problems on trees. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Kewen Zhao, Yu-Jong Tzeng, Ping Zhang 0004 Pancyclic graphs and degree sum and neighborhood union involving distance two. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Rangaswami Balakrishnan, T. Kavaskar b-coloring of Kneser graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Zhanjun Su, Sipeng Li, Jian Shen, Liping Yuan On the relative distances of nine or ten points in the boundary of a plane convex body. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Yeow Meng Chee, Lijun Ji, Andrew Lim, Anthony K. H. Tung Arboricity: An acyclic hypergraph decomposition problem motivated by database theory. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri, Asghar Asgharian-Sardroud A linear-time algorithm for the longest path problem in rectangular grid graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Enrique Bendito, Angeles Carmona, Andrés M. Encinas The Kirchhoff indices of join networks. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Kexiang Xu Trees with the seven smallest and eight greatest Harary indices. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos Containment relations in split graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Hosam Abdo, Darko Dimitrov, Ivan Gutman On the Zagreb indices equality. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Ramiro Feria-Purón, Guillermo Pineda-Villavicencio On bipartite graphs of defect at most 4. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan A shortest path-based approach to the multileaf collimator sequencing problem. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Yacine Boufkhad, Thomas Hugel Estimating satisfiability. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Hongbo Hua, Shenggui Zhang, Kexiang Xu Further results on the eccentric distance sum. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Emilio Di Giacomo, Walter Didimo, Peter Eades, Seok-Hee Hong, Giuseppe Liotta Bounds on the crossing resolution of complete geometric graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Michal Przykucki Optimal stopping in a search for a vertex with full degree in a random graph. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Chandra Mohan Krishnamurthy, R. Sritharan Maximum induced matching problem on hhd-free graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Aleksandar Ilic, Bo Zhou On reformulated Zagreb indices. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Qiaoming Han, Abraham P. Punnen Strong and weak edges of a graph and linkages with the vertex cover problem. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jing Li, Di Liu, Jun Yuan Pancyclicity of k-ary n-cube networks with faulty vertices and edges. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Li Zhang A (3, 1)*-choosable theorem on toroidal graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Wu-Hsiung Lin, Gerard J. Chang Equitable colorings of Cartesian products of graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1M. J. Morgan, Simon Mukwembi, Henda C. Swart A lower bound on the eccentric connectivity index of a graph. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Carmen Ortiz, Mónica Villanueva Maximal independent sets in caterpillar graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1K. Pattabiraman, P. Paulraja On some topological indices of the tensor products of graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Ricardo Riaza Cyclic matrices of weighted digraphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Sheng-Yi Cai, Qi-Fan Yang Online scheduling on three uniform machines. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Michael A. Henning, Adel P. Kazemi Total domination in inflated graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Stefan Stanimirovic, Predrag S. Stanimirovic, Aleksandar Ilic Ballot matrix as Catalan matrix power and related identities. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Gong Chen, Zhongxun Zhu The number of independent sets of unicyclic graphs with given matching number. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Bojan Dalbelo Basic Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jian-Hua Yin A short constructive proof of A. R. Rao's characterization of potentially Kr+1-graphic sequences. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Stefano Gualandi, Federico Malucelli A simple branching scheme for vertex coloring problems. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Yun Ding, Rosena R. X. Du Counting humps in Motzkin paths. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jacques-Olivier Lachaud, Xavier Provençal Two linear-time algorithms for computing the minimum length polygon of a digital contour. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ali Kakhbod, Morteza Zadimoghaddam On the construction of prefix-free and fix-free codes with specified codeword compositions. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Henry Martyn Mulder, Beth Novick An axiomatization of the median procedure on the n-cube. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Danny Hermelin, Dror Rawitz Optimization problems in multiple subtree graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jinn-Shyong Yang, Hung-Chang Chan, Jou-Ming Chang Broadcasting secure messages via optimal independent spanning trees in folded hypercubes. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Guanghui Wang, Shan Zhou, Guizhen Liu, Jianliang Wu Circular vertex arboricity. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Daobin Li, Baoyindureng Wu, Xunuan Yang, Xinhui An Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Luidi Simonetti, Yuri Frota, Cid C. de Souza The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Kun Meng, Chuang Lin, Wen An Liu, Yang Yang Q-ary Rényi-Ulam pathological liar game with one lie. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Zdenek Ryjácek, Gerhard J. Woeginger, Liming Xiong Hamiltonian index is NP-complete. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Edouard Wagneur, T. C. Edwin Cheng, C. T. Daniel Ng A closed-form solution for the optimal release times for the F2 deteriorating jobs ∑wjCj problem. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Moo Young Sohn, Dongseok Kim, Young Soo Kwon, Jaeun Lee On the existence problem of the total domination vertex critical graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Hal A. Kierstead, Karin R. Saoub First-Fit coloring of bounded tolerance graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Serkan Eryilmaz On the lifetime of a random binary sequence. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Tiziana Calamoneri, Rossella Petreschi The L(2, 1)-labeling of unigraphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Vincent Vajnovszki A new Euler-Mahonian constructive bijection. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Domingos Moreira Cardoso, Nicholas Korpelainen, Vadim V. Lozin On the complexity of the dominating induced matching problem in hereditary classes of graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Xing Gao, Yanfeng Luo, Wenwen Liu Resistance distances and the Kirchhoff index in Cayley graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jun-Lin Guo, Tao-Ming Wang, Yue-Li Wang Unique intersectability of diamond-free graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Bing Bai, Hongliang Lu, Qinglin Yu Generalization of matching extensions in graphs (III). Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Shinya Fujita, Colton Magnant Properly colored paths and cycles. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Karin Thörnblad, Michael Patriksson A note on the complexity of flow-shop scheduling with deteriorating jobs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Nicole Eggemann, Steven D. Noble The clustering coefficient of a scale-free random graph. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan On graphs without a C4 or a diamond. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Alexander K. Kelmans Packing 3-vertex paths in claw-free graphs and related topics. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Munevver Mine Subasi, Ersoy Subasi, Martin Anthony, Peter L. Hammer A new imputation method for incomplete binary data. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Yuichi Asahiro, Eiji Miyano, Hirotaka Ono Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Xue-Gang Chen, Moo Young Sohn Bounds on the locating-total domination number of a tree. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Vesna Andova, Saso Bogoev, Darko Dimitrov, Marcin Pilipczuk, Riste Skrekovski On the Zagreb index inequality of graphs with prescribed vertex degrees. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1E. Ebrahimi Targhi, Nader Jafari Rad, Lutz Volkmann Unique response Roman domination in graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jose Maria Sigarreta, Ismael Gónzalez Yero, Sergio Bermudo, Juan Alberto Rodríguez-Velazquez Partitioning a graph into offensive k-alliances. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Bo Jiang, Xuehou Tan Searching for mobile intruders in circular corridors by two 1-searchers. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Pavel Chebotarev A class of graph-geodetic distances generalizing the shortest-path and the resistance distances. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1David Canright, Sugata Gangopadhyay, Subhamoy Maitra, Pantelimon Stanica Laced Boolean functions and subset sum problems in finite fields. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ross J. Kang, Tobias Müller Frugal, acyclic and star colourings of graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Sergio Cabello, Marko Jakovac On the b-chromatic number of regular graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Hermann Gruber Bounding the feedback vertex number of digraphs in terms of vertex degrees. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky Untangling planar graphs from a specified vertex position - Hard cases. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ignasi Sau, Dimitrios M. Thilikos On self-duality of branchwidth in graphs of bounded genus. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Gunnar Brinkmann, Nicolas Van Cleemput Classification and generation of nanocones. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Peter Dankelmann On the distance distribution of trees. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michael R. Fellows, Henning Fernau Facility location problems: A parameterized view. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Cristina Bazgan, Sonia Toubaline, Zsolt Tuza The most vital nodes with respect to independent set and vertex cover. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Steven D. Noble, Pierre Hansen, Nenad Mladenovic Maximizing edge-ratio is NP-complete. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Won-Min Song, Tiziana di Matteo, Tomaso Aste Nested hierarchies in planar graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Felix Distel, Baris Sertkaya On the complexity of enumerating pseudo-intents. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Raphaël M. Jungers, Vincent D. Blondel Observable graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy Competitive subset selection with two agents. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Kexiang Xu, Kinkar Ch. Das On Harary index of graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Etienne de Klerk, Cristian Dobre A comparison of lower bounds for the symmetric circulant traveling salesman problem. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Oded Berman, Dmitry Krass On n-facility median problem with facilities subject to failure facing uniform demand. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Martin Knor, Guangjun Xu, Sanming Zhou A study of 3-arc graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Nathan Pflueger Graph reductions, binary rank, and pivots in gene assembly. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning An extremal problem for total domination stable graphs upon edge removal. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Petros A. Petrosyan, H. E. Sargsyan On resistance of graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1sarah-marie belcastro, Michael Young 1-factor covers of regular graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jonathan Lenchner On the affine Sylvester problem. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Nicola Apollonio, Massimiliano Caramia Recognizing Helly Edge-Path-Tree graphs and their clique graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ville Junnila, Tero Laihonen Identification in Z2 using Euclidean balls. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Jason Lewis, Alice A. McRae Matchability and k-maximal matchings. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Raffaele Mosca On distance-3 matchings and induced matchings. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Camino Balbuena, Pedro García-Vázquez, Luis Pedro Montejano Superconnectivity of graphs with odd girth g and even girth h. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 4488 (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 Jörg Diederich.
Based upon DBLP by Michael Ley.