The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "Theor. Comput. Sci."( http://dblp.L3S.de/Venues/Theor._Comput._Sci. )

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

Publication years (Num. hits)
1975-1976 (74) 1977 (41) 1978 (36) 1979 (48) 1980 (67) 1981 (82) 1982 (94) 1983 (109) 1984 (124) 1985 (152) 1986 (127) 1987 (108) 1988 (118) 1989 (131) 1990 (141) 1991 (251) 1992 (245) 1993 (239) 1994 (280) 1995 (227) 1996 (278) 1997 (283) 1998 (266) 1999 (253) 2000 (317) 2001 (378) 2002 (397) 2003 (570) 2004 (446) 2005 (440) 2006 (468) 2007 (436) 2008 (464) 2009 (477) 2010 (330) 2011 (567) 2012 (469) 2013 (446) 2014 (443) 2015 (520) 2016 (464) 2017 (380) 2018 (352) 2019 (271)
Publication types (Num. hits)
article(12409)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 12409 publication records. Showing 12409 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Bruno Escoffier Saving colors and Max Coloring: Some fixed-parameter tractability results. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yair Bartal, Lee-Ad Gottlieb Approximate nearest neighbor search for ℓp-spaces (2 Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Boaz Farbstein, Asaf Levin Deadline TSP. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Luca Cardelli, Mirco Tribastone, Max Tschaikowski, Andrea Vandin Symbolic computation of differential equivalences. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Narad Rampersad, Jeffrey Shallit, Élise Vandomme Critical exponents of infinite balanced words. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fei Huang, Xueliang Li 0001, Zhongmei Qin, Colton Magnant Minimum degree condition for proper connection number 2. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Juraj Kolcák, David Safránek, Stefan Haar, Loïc Paulevé Parameter space abstraction and unfolding semantics of discrete regulatory networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mouhammad Said, Jacques-Olivier Lachaud Analytical description of digital intersections: Minimal parameters and multiscale representation. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Georgios Konstantinidis, Athanasios Kehagias Selfish cops and active robber: Multi-player pursuit evasion on graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Irena Rusu Min (a)cyclic feedback vertex sets and min ones monotone 3-SAT. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Wei Ding 0006, Ke Qiu Approximating the restricted 1-center in graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Arash Ahadi, Alireza Zarei Connecting guards with minimum Steiner points inside simple polygons. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang A two-stages tree-searching algorithm for finding three completely independent spanning trees. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Petr Ambroz, Ondrej Kadlec, Zuzana Masáková, Edita Pelantová Palindromic length of words and morphisms in class P. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Shiying Wang, Mujiangshan Wang The g-good-neighbor and g-extra diagnosability of networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jürgen Dassow On the orbit of closure-involution operations - The case of formal languages. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Qingyu He, Luoshan Xu Weak algebraic information systems and a new equivalent category of DOM of domains. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ricardo Honorato-Zimmer, Andrew J. Millar, Gordon D. Plotkin, Argyris Zardilis Chromar, a language of parameterised agents. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Giorgio Ausiello, Lila Kari, Grzegorz Rozenberg, Donald Sannella, Paul G. Spirakis, Pierre-Louis Curien Preface. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Chao Xu 0010, Jianer Chen, Jianxin Wang Resolution and linear CNF formulas: Improved (n, 3)-MaxSAT algorithms. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Leslie Ann Goldberg, John Lapinskas, Johannes Lengler, Florian Meier, Konstantinos Panagiotou, Pascal Pfister Asymptotically optimal amplifiers for the Moran process. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Oscar H. Ibarra, Ian McQuillan, Bala Ravikumar On counting functions and slenderness of languages. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Antonio Caruso 0001 Editorial. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Albert Guan, Wen-Guey Tzeng A light-weight bit commitment protocol based on unpredictable channel noise. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fumiya Okubo, Takashi Yokomori Decomposition and factorization of chemical reaction transducers. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Miroslaw Kowaluk, Andrzej Lingas A fast deterministic detection of small pattern graphs in graphs without large cliques. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Luís M. S. Russo A study on splay trees. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Rodrigo Ferreira da Silva, Sebastián Urrutia, Vinícius Fernandes dos Santos One-Sided Weak Dominance Drawing. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Arnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari Counting in one-hop beeping networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Kai Zhang 0016, Jie Chen 0021, Hyung Tae Lee, Haifeng Qian, Huaxiong Wang Efficient public key encryption with equality test in the standard model. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jørgen Bang-Jensen, Stéphane Bessy Degree-constrained 2-partitions of graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jin Chen, Zhi-Xiong Wen On the abelian complexity of generalized Thue-Morse sequences. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Hoàng-Oanh Le, Van Bang Le A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Thierry Coquand Canonicity and normalization for dependent type theory. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Majid Khonji, Areg Karapetyan, Khaled M. Elbassioni, Sid Chi-Kin Chau Complex-demand scheduling problem with application in smart grid. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yi Xu, Jigen Peng, Yinfeng Xu, Binhai Zhu The discrete and mixed minimax 2-center problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Michael Wallner A bijection of plane increasing trees with relaxed binary trees of right height at most one. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jou-Ming Chang, Kung-Jui Pai, Ro-Yu Wu, Jinn-Shyong Yang The 4-component connectivity of alternating group networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Shimin Li, Haitao Wang 0001 Algorithms for covering multiple barriers. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jérôme Feret, Loïc Paulevé, David Safránek Preface. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sayan Bhattacharya, Monika Henzinger, Stefan Neumann 0003 New amortized cell-probe lower bounds for dynamic problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Hafsteinn Einarsson, Marcelo Matheus Gauy, Johannes Lengler, Florian Meier, Asier Mujika, Angelika Steger, Felix Weissenberger The linear hidden subset problem for the (1 + 1) EA with scheduled and adaptive mutation rates. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nicholas R. Beaton, Mathilde Bouvel, Veronica Guerrini, Simone Rinaldi Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Zhao Wang, Yaping Mao, Eddie Cheng, Jinyu Zou Matching preclusion number of graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Cosimo Vinci Non-atomic one-round walks in congestion games. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ning Xie, Shuai Xu, Yekun Xu A new coding-based algorithm for finding closest pair of vectors. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yo-Sub Han, Hwee Kim Ruleset optimization on isomorphic oritatami systems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tiziana Calamoneri, Matteo Dell'Orefice, Angelo Monti A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yoshifumi Sakai A substring-substring LCS data structure. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen, Huaxiong Wang Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Bojan Marinkovic, Paola Glavan, Zoran Ognjanovic Proving properties of the Chord protocol using the ASM formalism. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yongjie Yang, Yash Raj Shrestha, Jiong Guo On the complexity of bribery with distance restrictions. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Benjamin Bergougnoux, Mamadou Moustapha Kanté Fast exact algorithms for some connectivity problems parameterized by clique-width. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Can Umut Ileri, Orhan Dagdeviren A self-stabilizing algorithm for b-matching. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pedro Ribeiro 0002, Ana Cavalcanti Angelic processes for CSP via the UTP. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jie Xue, Huiqiu Lin, Jinlong Shu The algebraic connectivity of graphs with given circumference. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Qiang Zhu 0003, Lili Li, Sanyang Liu, Xing Zhang Hybrid fault diagnosis capability analysis of hypercubes under the PMC model and MM⁎ model. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Vivek Nigam, René Thiemann Logical and Semantic Frameworks with Applications. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Xiang-Jun Li, Min Liu, Zheng Yan, Jun-Ming Xu On conditional fault tolerance of hierarchical cubic networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mário S. Alvim, Konstantinos Chatzikokolakis 0001, Annabelle McIver, Carroll Morgan, Catuscia Palamidessi, Geoffrey Smith An axiomatization of information flow measures. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Paul M. B. Vitányi Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Qiang Dong, Xi Wang How many triangles and quadrilaterals are there in an n-dimensional augmented cube? Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fidaa Abed, Lin Chen 0009, Yann Disser, Martin Groß 0001, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke Scheduling maintenance jobs in networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Rui-Juan Jing, Chun-Ming Yuan, Xiao-Shan Gao A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over Z[x]. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Gilles Bernot, Jean-Paul Comet, Zohra Khalis, Adrien Richard, Olivier F. Roux A genetically modified Hoare logic. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Luca Cardelli, Mirco Tribastone, Max Tschaikowski, Andrea Vandin Comparing chemical reaction networks: A categorical and algorithmic perspective. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sanjib Sadhu, Sasanka Roy, Subhas C. Nandy, Suchismita Roy Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Arne Leitert, Feodor F. Dragan Parameterized approximation algorithms for some location problems in graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno Active influence spreading in social networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mauricio Ayala-Rincón, Washington de Carvalho Segundo, Maribel Fernández, Daniele Nantes-Sobrinho, Ana Cristina Rocha Oliveira A formalisation of nominal α-equivalence with A, C, and AC function symbols. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Marco Bernardo 0001, Marino Miculan Constructive logical characterizations of bisimilarity for reactive probabilistic systems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Rostam Sabeti Polynomial expressions for non-binomial structures. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Begum Genc, Mohamed Siala 0002, Gilles Simonin, Barry O'Sullivan Complexity Study for the Robust Stable Marriage Problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Frank Gurski, Carolin Rehs, Jochen Rethmann Knapsack problems: A parameterized point of view. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman 0001, Prafullkumar Tale Harmonious coloring: Parameterized algorithms and upper bounds. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj Recommending links through influence maximization. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Motahhareh Gharahi, Shahram Khazaei Optimal linear secret sharing schemes for graph access structures on six participants. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack Weighted minimum backward Fréchet distance. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dimitri Lajou On the achromatic number of signed graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Hoàng-Oanh Le, Van Bang Le Map graphs having witnesses of large girth. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Guangwei Wu, Jianer Chen, Jianxin Wang Scheduling two-stage jobs on multiple flowshops. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Andrew Ryzhikov On automata recognizing birecurrent sets. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Carlos Lombardi, Alejandro Ríos, Roel de Vrijer Projections for infinitary rewriting (extended version). Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sanjay Jain 0001, Efim B. Kinber Intrinsic complexity of partial learning. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Stefan Ehard, Dieter Rautenbach Vaccinate your trees! Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Guozhen Zhang, Shangwei Lin Path and cycle fault tolerance of bubble-sort graph networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1David Orellana-Martín, Luis Valencia-Cabrera, Agustín Riscos-Núñez, Mario J. Pérez-Jiménez A path to computational efficiency through membrane computing. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Carlos Caleiro, Filipe Casal, Andreia Mordido Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dongjing Miao, Xianmin Liu, Yingshu Li, Jianzhong Li Vertex cover in conflict graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Christophe Crespelle Fully dynamic representations of interval graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Bireswar Das, Murali Krishna Enduri, Masashi Kiyomi, Neeldhara Misra, Yota Otachi, I. Vinod Reddy, Shunya Yoshimura On structural parameterizations of firefighting. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tingfang Wu, Linqiang Pan, Artiom Alhazov Computation power of asynchronous spiking neural P systems with polarizations. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Paola Giannini, Marco Servetto, Elena Zucca, James Cone Flexible recovery of uniqueness and immutability. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Cristina Bazgan, Thomas Pontoizeau, Zsolt Tuza Finding a potential community in networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yicheng Xu, Dachuan Xu, Donglei Du, Chenchen Wu Improved approximation algorithm for universal facility location problem with linear penalties. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Hai Q. Dinh, Abhay Kumar Singh, Sukhamoy Pattanayak, Songsak Sriboonchitta Construction of cyclic DNA codes over the ring Z4[u]/〈u2-1〉 based on the deletion distance. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jeffery Kline Geometric search for Hadamard matrices. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Riccardo Dondi, Giancarlo Mauri, Italo Zoppis On the tractability of finding disjoint clubs in a network. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Olivier Hudry, Antoine Lobstein Unique (optimal) solutions: Complexity results for identifying and locating-dominating codes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 12409 (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