The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "Inf. Process. Lett."( http://dblp.L3S.de/Venues/Inf._Process._Lett. )

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

Publication years (Num. hits)
1971 (18) 1972 (42) 1973 (39) 1974 (26) 1975 (57) 1976 (69) 1977 (56) 1978 (77) 1979 (128) 1980 (116) 1981 (119) 1982 (106) 1983 (111) 1984 (102) 1985 (99) 1986 (121) 1987 (179) 1988 (185) 1989 (205) 1990 (193) 1991 (232) 1992 (237) 1993 (206) 1994 (220) 1995 (237) 1996 (218) 1997 (210) 1998 (206) 1999 (165) 2000 (146) 2001 (134) 2002 (207) 2003 (205) 2004 (189) 2005 (173) 2006 (178) 2007 (184) 2008 (254) 2009 (241) 2010 (220) 2011 (194) 2012 (196) 2013 (178) 2014 (135) 2015 (188) 2016 (135) 2017 (122) 2018 (159) 2019 (107)
Publication types (Num. hits)
article(7524)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 7524 publication records. Showing 7524 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Mohamed Siala 0002, Barry O'Sullivan Combinatorial search from an energy perspective. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Guanqun Ni, Feifeng Zheng, Yinfeng Xu Competitive analysis of online revenue management with hierarchical resources. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ramin Mousavi Thin trees in 8-edge-connected planar graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sadegh Sadeghi, Nasour Bagheri Security analysis of SIMECK block cipher against related-key impossible differential. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Henrique Damasceno Vianna, Jorge Luis Victória Barbosa A scalable model for building context-aware applications for noncommunicable diseases prevention. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Samuel Neves, Filipe Araújo An observation on NORX, BLAKE2, and ChaCha. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Veli Mäkinen, Tuukka Norri Applying the Positional Burrows-Wheeler Transform to all-pairs Hamming distance. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Naoyuki Kamiyama A note on balanced flows in equality networks. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ahmet Arslan How sensitive are the term-weighting models of information retrieval to spam Web pages? Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty Bottleneck bichromatic full Steiner trees. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Andreas Brandstädt, Martin Milanic A dichotomy for weighted efficient dominating sets with bounded degree vertices. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Chenhuang Wu, Chunxiang Xu, Zhixiong Chen, Pinhui Ke On error linear complexity of new generalized cyclotomic binary sequences of period p2. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Lei Sun, Jian Liu 0004, Fang-Wei Fu Secondary constructions of RSBFs with good cryptographic properties. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Abdelouadoud Stambouli, Luigi Logrippo Data flow analysis from capability lists, with application to RBAC. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Gonçalo Gutierres, Ricardo Mamede, José Luís Santos Optimal Gray code for involutions. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Stéphane Le Roux 0001 Memoryless determinacy of infinite parity games: Another simple proof. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1John Machacek Partial words with a unique position starting a square. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Enes Pasalic, Sugata Gangopadhyay, Wei-Guo Zhang, Samed Bajric Design methods for semi-bent functions. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Adi Shraibman The corruption bound, log-rank, and communication complexity. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Khaled A. S. Abdel-Ghaffar Sets of binary sequences with small total Hamming distances. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Xiaoyan Li, Yuan-Hsiang Teng, Tzu-Liang Kung, Qi Chen, Cheng-Kuan Lin The diagnosability and 1-good-neighbor conditional diagnosability of hypercubes with missing links and broken-down nodes. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Huazhong Lü On the conjecture of vertex-transitivity of DCell. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pedro Reviriego, Salvatore Pontarelli, Gil Levy CuCoTrack: Cuckoo filter based connection tracking. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ziwen Liu, Chao Yang 0003 Hanano Puzzle is NP-hard. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Achour Mostéfaoui, Matthieu Perrin, Michel Raynal, Jiannong Cao Crash-tolerant causal broadcast in O(n) messages. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Lena Schlipf, Jens M. Schmidt Simple computation of st-edge- and st-numberings from ear decompositions. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yuan Yuan, Rong-Xia Hao A degree condition for fractional [a, b]-covered graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sanjay Jain 0001, Bakhadyr Khoussainov, Philipp Schlicht, Frank Stephan 0001 The isomorphism problem for tree-automatic ordinals with addition. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nikolaj Tatti Strongly polynomial efficient approximation scheme for segmentation. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Patrick K. Nicholson Revisiting explicit adaptive two-probe schemes. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Zachary A. Kissel Key regression from constrained pseudorandom functions. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Martín Rinemberg, Francisco J. Soulignac The eternal dominating set problem for interval graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich Routing with congestion in acyclic digraphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento On the geodetic number of complementary prisms. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Davood Bakhshesh, Mohammad Farshi Fault tolerancy of continuous Yao graph of angle less than 2π/5. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Deepayan Sanyal, Swagatam Das On semi-supervised active clustering of stable instances with oracles. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Anupriya Jha, Dinabandhu Pradhan, S. Banerjee The secure domination problem in cographs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Raghunath Reddy Madireddy, Apurva Mudgal NP-hardness of geometric set cover and hitting set with rectangles containing a common point. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Shlomi Dolev, Anat Eyal, Danny Hendler, Philip Derbeko, Marina Sadetsky Upper bounds for multi-level multi-server paging. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Huazhong Lü, Tingzeng Wu Edge-disjoint Hamiltonian cycles of balanced hypercubes. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1René Bødker Christensen On one-round reliable message transmission. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Bin Sheng, Yuefang Sun An improved linear kernel for the cycle contraction problem. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Xuanjiao Lv, Lin Xiao, Zhiguo Tan Improved Zhang neural network with finite-time convergence for time-varying linear system of equations solving. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Alexandros A. Voudouris A note on the efficiency of position mechanisms with budget constraints. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Amanda Clare, Jacqueline W. Daykin Enhanced string factoring from alphabet orderings. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Changming Zhu, Chengjiu Mei, Rigui Zhou Weight-based label-unknown multi-view data set generation approach. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jung-Heum Park, Insung Ihm A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sven C. Polak, Alexander Schrijver New lower bound on the Shannon capacity of C7 from circular graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Hannaneh Akrami, Kurt Mehlhorn, Tommy Odland Ratio-balanced maximum flows. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Chun Jiang Zhu, Kam-yiu Lam, Joseph Kee-Yin Ng, Jinbo Bi On the VC-dimension of unique round-trip shortest path systems. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Alfredo Rial A conditional access system with revocation for mobile pay-TV systems revisited. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dimitri Surinx, Jan Van den Bussche A monotone preservation result for Boolean queries expressed as a containment of conjunctive queries. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Tom C. van der Zanden On exploring always-connected temporal graphs of small pathwidth. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Maximilian Fürst On the hardness of deciding the equality of the induced and the uniquely restricted matching number. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Iago A. Carvalho On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Weibo Lin, Mingyu Xiao A (3 + ϵ)k-vertex kernel for edge-disjoint triangle packing. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Naoki Matsumoto The difference between game chromatic number and chromatic number of graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Robert Glück, Tetsuo Yokoyama Constructing a binary tree from its traversals by reversible recursion and iteration. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries Classifying k-edge colouring for H-free graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Kung-Jui Pai, Jou-Ming Chang Improving the diameters of completely independent spanning trees in locally twisted cubes. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dmitry Kosolobov, Arseny M. Shur Comparison of LZ77-type parsings. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Qian Guo 0001, Thomas Johansson 0001 A new birthday-type algorithm for attacking the fresh re-keying countermeasure. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Martin E. Dyer, Haiko Müller Counting independent sets in cocomparability graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Alexey Milovanov #P-completeness of counting roots of a sparse polynomial. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Hongyang Sun Non-clairvoyant scheduling with conflicts for unit-size jobs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Shang-En Huang, Seth Pettie Thorup-Zwick emulators are universally optimal hopsets. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Maxime Meyer, Ben Smyth Exploiting re-voting in the Helios election system. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pradip K. Srimani, James Z. Wang Self-stabilizing algorithm for two disjoint minimal dominating sets. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Hoda Jannati, Ramtin Khosravi On the security of one-round meeting location determination protocol. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Rongjia Li, Chenhui Jin, Hongchen Pan Key recovery attacks on reduced-round Joltik-BC in the single-key setting. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Laurent Mouchard, Élise Prieur, Bruce W. Watson Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Stasys Jukna, Hannes Seiwert Greedy can beat pure dynamic programming. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Daniël Paulusma, Stefan Szeider On the parameterized complexity of (k, s)-SAT. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Carl Feghali Paths between colourings of graphs with bounded tree-width. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Gülsüm Gözde Güzel, Muharrem Tolga Sakalli, Sedat Akleylek, Vincent Rijmen, Yasemin Cengellenmis A new matrix form to generate all 3 × 3 involutory MDS matrices over F2m. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Marwa Yusuf, Ahmed El-Mahdy, Erven Rohou Towards automatic binary runtime loop de-parallelization using on-stack replacement. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Frank Ban, Kamal Jain, Christos H. Papadimitriou, Christos-Alexandros Psomas, Aviad Rubinstein Reductions in PPP. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Matthias Gerstgrasser Reverse auctions are different from auctions. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1György Dósa, Leah Epstein A new lower bound on the price of anarchy of selfish bin packing. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pasin Manurangsi A note on degree vs gap of Min-Rep Label Cover and improved inapproximability for connectivity problems. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Xuepeng Cai, Elkin Vumar The super connectivity of folded crossed cubes. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mikhail Y. Kovalyov, Gur Mosheiov, Dmitrij Sesok Comments on "Proportionate flowshops with general position dependent processing times" [Inf. Process. Lett. 111 and "Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection" [Inf. Process. Lett. 132 (2018) 39-43]. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eminjan Sabir, Jixiang Meng Parallel routing in regular networks with faults. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Unjong Yu, Jeong-Ok Choi A note on general epidemic region for infinite regular graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sebastian Siebertz Greedy domination on biclique-free graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Chunhuan Zhao, Zhongxiang Zheng Improved analysis of the reduction from BDD to uSVP. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ching-Lueh Chang On Las Vegas approximations for metric 1-median selection. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Purnata Ghosal, B. V. Raghavendra Rao A note on parameterized polynomial identity testing using hitting set generators. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1David Clark, Robert M. Hierons, Krishna Patel Normalised Squeeziness and Failed Error Propagation. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Gang Ma, Qiuju Bian, Jianfeng Wang The maximum PI index of bicyclic graphs with even number of edges. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Raghunath Reddy Madireddy, Apurva Mudgal Approximability and hardness of geometric hitting set with axis-parallel rectangles. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Israel Aldana-Galvan, Jose Luis Alvarez-Rebollar, Juan Carlos Catana-Salazar, Mazay Jimenez-Salinas, Erick Solís-Villarreal, Jorge Urrutia Minimizing the solid angle sum of orthogonal polyhedra. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Samer Nofal, Katie Atkinson, Paul E. Dunne On checking skeptical and ideal admissibility in abstract argumentation frameworks. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dekel Tsur The effective entropy of next/previous larger/smaller value queries. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ishu Gupta, Ashutosh Kumar Singh Dynamic threshold based information leaker identification scheme. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Michitaka Furuya, Naoki Matsumoto A note on domination 3-edge-critical planar graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Simon Halfon, Philippe Schnoebelen On shuffle products, acyclic automata and piecewise-testable languages. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Lin Xiao, Kenli Li, Zhiguo Tan, Zhijun Zhang 0003, Bolin Liao, Ke Chen 0004, Long Jin, Shuai Li 0002 Nonlinear gradient neural network for solving system of linear equations. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Markus Lohrey, Carl Philipp Reh, Kurt Sieber Size-optimal top dag compression. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dekel Tsur Faster parameterized algorithm for pumpkin vertex deletion set. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 7524 (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.
open data data released under the ODC-BY 1.0 license