The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for degree with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1945-1964 (15) 1966-1968 (15) 1969-1971 (16) 1972-1974 (20) 1975 (18) 1976-1977 (31) 1978 (32) 1979 (23) 1980 (25) 1981 (18) 1982 (28) 1983 (24) 1984 (31) 1985 (46) 1986 (44) 1987 (71) 1988 (90) 1989 (111) 1990 (133) 1991 (113) 1992 (146) 1993 (181) 1994 (185) 1995 (245) 1996 (258) 1997 (318) 1998 (323) 1999 (431) 2000 (594) 2001 (689) 2002 (796) 2003 (894) 2004 (1336) 2005 (1517) 2006 (1806) 2007 (2003) 2008 (2041) 2009 (1439) 2010 (563) 2011 (445) 2012 (475) 2013 (479) 2014 (518) 2015 (541) 2016 (588) 2017 (652) 2018 (731) 2019 (799) 2020 (756) 2021 (741) 2022 (771) 2023 (796) 2024 (194)
Publication types (Num. hits)
article(10380) book(2) data(3) incollection(109) inproceedings(14620) phdthesis(41)
Venues (Conferences, Journals, ...)
CoRR(1209) Discret. Math.(495) Discret. Appl. Math.(243) J. Graph Theory(210) ICRA(185) Graphs Comb.(157) SODA(153) Electron. J. Comb.(134) IROS(131) STOC(131) IEEE Access(128) IEEE Trans. Parallel Distribut...(128) Electron. Colloquium Comput. C...(114) ISSAC(114) HICSS(113) CDC(112) More (+10 of total 3767)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 15540 occurrences of 6850 keywords

Results
Found 25155 publication records. Showing 25155 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
13Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko Approximating Minimum-Power Degree and Connectivity Problems. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
13Ming Zhong 0006, Kai Shen, Joel I. Seiferas Replication degree customization for high availability. Search on Bibsonomy EuroSys The full citation details ... 2008 DBLP  DOI  BibTeX  RDF optimization, replication, system availability
13Emanuele Viola The Sum of d Small-Bias Generators Fools Polynomials of Degree d. Search on Bibsonomy CCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
13Milan Nikolic, Zvonko Sajfert, Milivoj Klarin Impact of the degree of a company's success on the importance of the criteria for selecting a new product. Search on Bibsonomy Oper. Res. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF selection of a new product, multi-criteria decision analysis, criteria importance, food industry, fuzzy sets
13Madhusudan Hosaagrahara, Harish Sethu Degree-sequenced matching algorithms for input-queued switches. Search on Bibsonomy Telecommun. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Scheduling and matching algorithms, Input-queued switches
13Hiroshi Nagamochi Minimum Degree Orderings. Search on Bibsonomy ISAAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
13Markus Behle, Michael Jünger, Frauke Liers A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. Search on Bibsonomy WEA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
13Rui Duan, Mingsheng Zhang Design of Web-based Management Information System for Academic Degree & Graduate Education. Search on Bibsonomy I3E (2) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
13Vadim V. Lozin, Martin Milanic Tree-Width and Optimization in Bounded Degree Graphs. Search on Bibsonomy WG The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Hereditary class of graphs, Induced Matching, Dominating set, Tree-width
13Xudong Ni, Junzhou Luo, Aibo Song A Trust Degree Based Access Control for Multi-domains in Grid Environment. Search on Bibsonomy CSCWD The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
13Magnús M. Halldórsson, Elena Losievskaja Independent Sets in Bounded-Degree Hypergraphs. Search on Bibsonomy WADS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
13Qiuxin Wu, Liming Xiong, Tingzeng Wu Even Factors with Degree at Most Four in Claw-Free Graphs. Search on Bibsonomy International Conference on Computational Science (3) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF even factor, branch-bond, claw-free graph
13Lawton N. Verner, Allison M. Okamura Effects of Translational and Gripping Force Feedback are Decoupled in a 4-Degree-of-Freedom Telemanipulator. Search on Bibsonomy WHC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
13Seungbeom Lee, Hanho Lee, Jongyoon Shin, Je-Soo Ko A High-Speed Pipelined Degree-Computationless Modified Euclidean Algorithm Architecture for Reed-Solomon Decoders. Search on Bibsonomy ISCAS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
13Yi Xu, Long-shu Li, Xuejun Li 0001 Improved Rough Set Model Based on Set Pair Connection Degree. Search on Bibsonomy FSKD (1) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
13Kangyin Yin, Zilin Song, Weihua Ai, Yaxin Yi Ontology Mapping Based-on Angle Degree of Approaching. Search on Bibsonomy FSKD (2) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
13Iskander Sh. Kalimullin Some Notes on Degree Spectra of the Structures. Search on Bibsonomy CiE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
13Jae Hyun Baek, Myung Hoon Sunwoo New degree computationless modified euclid algorithm and architecture for Reed-Solomon decoder. Search on Bibsonomy IEEE Trans. Very Large Scale Integr. Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
13Florian Luca, Igor E. Shparlinski Elliptic Curves with Low Embedding Degree. Search on Bibsonomy J. Cryptol. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
13Ron Shaw, Neil A. Gordon The Polynomial Degree of the GrassmannianG1, n, 2. Search on Bibsonomy Des. Codes Cryptogr. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF 05C90, 11G25, 14M15, AMS Classification 51E20
13Robert D. Campbell Associate-degree transfer curriculum in computer engineering. Search on Bibsonomy ACM SIGCSE Bull. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
13Navaratnasothie Selvakkumaran, George Karypis Multiobjective hypergraph-partitioning algorithms for cut and maximum subdomain-degree minimization. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
13Hartmut Prautzsch, Georg Umlauf Parametrizations for triangular Gk spline surfaces of low degree. Search on Bibsonomy ACM Trans. Graph. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF CAD, Geometric modeling, surfaces, curves
13Sergey G. Molodtsov Largest Graphs of Diameter 2 and Maximum Degree 6. Search on Bibsonomy GTIT-C The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
13Harold N. Gabow Upper degree-constrained partial orientations. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
13Michel X. Goemans Minimum Bounded Degree Spanning Trees. Search on Bibsonomy FOCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
13Arturas Kaklauskas, Edmundas Kazimieras Zavadskas, Ruslanas Ditkevicius An Intelligent Tutoring System for Construction and Real Estate Management Master Degree Studies. Search on Bibsonomy CDVE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
13Fouad B. Chedid A Group Quorum System of Degree 1+sqrt(1+n/m). Search on Bibsonomy ICDCN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
13Gregory W. Hislop, Heidi J. C. Ellis Retention of distance and on-campus students in a graduate computer science degree program. Search on Bibsonomy ITiCSE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF student retention, online learning, graduate education, online education
13Shoujue Wang, Singsing Liu, Wenming Cao 0001 Research on Multi-Degree-of-Freedom Neurons with Weighted Graphs. Search on Bibsonomy ISNN (1) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
13Cuifeng Li, Wenzhan Dai The Application of Grey Relation Close Degree Model in the Fault Diagnosis. Search on Bibsonomy ICIC (2) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
13Iyad A. Kanj, Ljubomir Perkovic Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks. Search on Bibsonomy ALGOSENSORS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
13Joel J. P. C. Rodrigues, Mário M. Freire, Pascal Lorenz Performance implications of control packet processing and optical switch configuration times for optical burst switched mesh networks with degree-four topologies. Search on Bibsonomy ISCN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
13Nan Zhang, Yuanchun Shi, Bin Chang Degree Pre-Reserved Hierarchical Tree for Multimedia Multicast. Search on Bibsonomy ICME The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
13Hyun Gi Ahn, Tae-Jin Lee 0001, Min Young Chung, Hyunseung Choo Longest Path First WDM Multicast Protection for Maximum Degree of Sharing. Search on Bibsonomy International Conference on Computational Science (1) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
13Takuro Fukunaga, Hiroshi Nagamochi Network Design with Edge-Connectivity and Degree Constraints. Search on Bibsonomy WAOA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
13Youngchul Bae, Malrey Lee, Thomas M. Gatton An Obstacle Avoidence Method for Chaotic Robots Using Angular Degree Limitions. Search on Bibsonomy ICCSA (3) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
13Alexandra A. Soskova Relativized Degree Spectra. Search on Bibsonomy CiE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
13Michael R. Capalbo Explicit Bounded-Degree Unique-Neighbor Concentrators. Search on Bibsonomy Comb. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C35
13David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman 0001, S. Srinivasa Rao 0001 Representing Trees of Higher Degree. Search on Bibsonomy Algorithmica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Cardinal trees, Ordinal trees, Digital search trees, Data structures, Data compression, Information theory, Hashing, Analysis of algorithms, Dictionary, Tries, Succinct data structures
13Therese C. Biedl, Dana F. Wilkinson Bounded-Degree Independent Sets in Planar Graphs. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
13Yushin Cho, William A. Pearlman Quantifying the coding power of zerotrees of wavelet coefficients: a degree-k zerotree model. Search on Bibsonomy ICIP (3) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
13Michel Beigbeder, Annabelle Mercier An information retrieval model using the fuzzy proximity degree of term occurences. Search on Bibsonomy SAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF fuzzy proximity, fuzzy set theory, proximity
13Robert Lowe, Chrystopher L. Nehaniv, Daniel Polani, Lola Cañamero The degree of potential damage in agonistic contests and its effects on social aggression, territoriality and display evolution. Search on Bibsonomy Congress on Evolutionary Computation The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
13Samir Khuller, Kwangil Lee, Mark A. Shayman On Degree Constrained Shortest Paths. Search on Bibsonomy ESA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
13Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Vittorio Scarano Degree-Optimal Deterministic Routing for P2P Systems. Search on Bibsonomy ISCC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
13Qiumei Chen, Wenzhan Dai The General Method of Improving Smooth Degree of Data Series. Search on Bibsonomy ICIC (1) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
13Su-Wei Tan, A. Gill Waters, John S. Crawford MeshTree: Reliable Low Delay Degree-bounded Multicast Overlays. Search on Bibsonomy ICPADS (2) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
13Toshiya Mashima, Takanori Fukuoka, Satoshi Taoka, Toshimasa Watanabe Minimum augmentation to bi-connect specified vertices of a graph with upper bounds on vertex-degree. Search on Bibsonomy ISCAS (1) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
13Chris J. Dafis, Chika Nwankpa Characteristics of Degree of Observability Measure for Nonlinear Power Systems. Search on Bibsonomy HICSS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
13Yunliang Jiang, Yueting Zhuang, Yong Liu 0007, Keqin Zhao On Identity-Discrepancy-Contrary Connection Degree in SPA and Its Applications. Search on Bibsonomy FSKD (1) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
13Feng Liu, Xicheng Lu, Yuxing Peng 0001 An Efficient Heuristic Algorithm for Constructing Delay- and Degree-Bounded Application-Level Multicast Tree. Search on Bibsonomy GCC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
13Chris Christiansen, Thomas Mailund, Christian N. S. Pedersen, Martin Randers Computing the Quartet Distance Between Trees of Arbitrary Degree. Search on Bibsonomy WABI The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
13Raitis Ozols, Rusins Freivalds, Jevgenijs Ivanovs, Elina Kalnina, Lelde Lace, Masahiro Miyakawa, Hisayuki Tatsumi, Daina Taimina Boolean Functions with a Low Polynomial Degree and Quantum Query Algorithms. Search on Bibsonomy SOFSEM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
13Fabien Viger, Matthieu Latapy Efficient and Simple Generation of Random Simple Connected Graphs with Prescribed Degree Sequence. Search on Bibsonomy COCOON The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
13Feng Liu, Xicheng Lu, Yuxing Peng 0001, Jingshu Huang An Efficient Distributed Algorithm for Constructing Delay and Degree-Bounded Application-Level Multicast Tree. Search on Bibsonomy ISPAN The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
13Xiang-Yang Li 0001, Ivan Stojmenovic, Yu Wang 0003 Partial Delaunay Triangulation and Degree Limited Localized Bluetooth Scatternet Formation. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Bluetooth, Delaunay triangulation, scatternet formation
13Wayne Goddard Minimum Degree Conditions for Cycles Including Specified Sets of Vertices. Search on Bibsonomy Graphs Comb. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
13Antoni Marczyk On the Set of Cycle Lengths in a Hamiltonian Graph with a Given Maximum Degree. Search on Bibsonomy Graphs Comb. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Pancyclic graphs, Cycles, Hamiltonian graphs
13Timothy M. Chan Euclidean Bounded-Degree Spanning Tree Ratios. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
13Anselm Spoerri Metacrystal: visualizing the degree of overlap between different search engines. Search on Bibsonomy WWW (Alternate Track Papers & Posters) The full citation details ... 2004 DBLP  DOI  BibTeX  RDF information visualization, meta searching
13Xiafeng Li, Derek Leonard, Dmitri Loguinov On Reshaping of Clustering Coefficients in Degree-Based Topology Generators. Search on Bibsonomy WAW The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
13Zhi-Zhong Chen, Tatsuie Tsukiji Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs. Search on Bibsonomy WG The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
13Haiying Shen, Cheng-Zhong Xu 0001, Guihai Chen Cycloid: A Constant-Degree and Lookup-Efficient P2P Overlay Network. Search on Bibsonomy IPDPS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
13Sang-Moon Soak, David Corne, Byung-Ha Ahn A New Encoding for the Degree Constrained Minimum Spanning Tree Problem. Search on Bibsonomy KES The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
13Jie Li 0001, Xinbo Gao 0001, Licheng Jiao A New Cluster Validity Function Based on the Modified Partition Fuzzy Degree. Search on Bibsonomy Rough Sets and Current Trends in Computing The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
13Miroslav Chlebík, Janka Chlebíková On Approximability of the Independent Set Problem for Low Degree Graphs. Search on Bibsonomy SIROCCO The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
13Uriel Feige On sums of independent random variables with unbounded variance, and estimating the average degree in a graph. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF shortest paths, inequalities
13Toshinori Yamada Fault-Tolerant Meshes with Constant Degree. Search on Bibsonomy COCOON The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
13Pamela S. Ecker, Jason Caudill, David Hoctor, Colleen Meyer Implementing an interdisciplinary capstone course for associate degree information technology programs. Search on Bibsonomy SIGITE Conference The full citation details ... 2004 DBLP  DOI  BibTeX  RDF teamwork, student projects, experiential learning, capstone courses
13Janusz Rajski, Jerzy Tyszer Primitive Polynomials Over GF(2) of Degree up to 660 with Uniformly Distributed Coefficients. Search on Bibsonomy J. Electron. Test. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF ring generators, linear feedback shift registers, primitive polynomials
13Maria Luisa Bonet, Nicola Galesi Degree complexity for a modified pigeonhole principle. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
13Sanjeev Arora, Kevin L. Chang Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem. Search on Bibsonomy ICALP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
13Timothy M. Chan Euclidean bounded-degree spanning tree ratios. Search on Bibsonomy SCG The full citation details ... 2003 DBLP  DOI  BibTeX  RDF approximation, minimum spanning trees, discrete geometry
13Abraham Flaxman, Alan M. Frieze, Trevor I. Fenner High Degree Vertices and Eigenvalues in the Preferential Attachment Graph. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
13Guy-Vincent Jourdan, Ivan Rival, Nejib Zaguia Degree Navigator™: The Journey of a Visualization Software. Search on Bibsonomy GD The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
13Roland Bauer, Sabine T. Köszegi, Michaela Wolkerstorfer Measuring the Degree of Virtualization - An Empirical Analysis in two Austrian Industries. Search on Bibsonomy HICSS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
13Narong Punnim Degree Sequences and Chromatic Numbers of Graphs. Search on Bibsonomy Graphs Comb. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
13Therese C. Biedl, Dana F. Wilkinson Bounded-Degree Independent Sets in Planar Graphs. Search on Bibsonomy ISAAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
13Andrej Bogdanov, Kenji Obata, Luca Trevisan A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs. Search on Bibsonomy FOCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
13Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid Constructing Plane Spanners of Bounded Degree and Low Weight. Search on Bibsonomy ESA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
13Piotr Berman, Marek Karpinski Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION. Search on Bibsonomy ICALP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
13Josep Díaz, Jaroslav Nesetril, Maria J. Serna, Dimitrios M. Thilikos H-Colorings of Large Degree Graphs. Search on Bibsonomy EurAsia-ICT The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
13Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson Randomness conductors and constant-degree lossless expanders. Search on Bibsonomy STOC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF expander graphs, extractors, condensers, graph products
13Dimitris Achlioptas, Cristopher Moore Almost all graphs with average degree 4 are 3-colorable. Search on Bibsonomy STOC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF threshold phenomena, graph coloring, random graphs
13Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson Randomness Conductors and Constant-Degree Lossless Expanders. Search on Bibsonomy CCC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF expander graphs, extractors, condensers, graph products
13Tarun Banka, Abhijit A. Bare, Anura P. Jayasumana Metrics for Degree of Reordering in Packet Sequences. Search on Bibsonomy LCN The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
13Raphael Yuster Large Monotone Paths in Graphs with Bounded Degree. Search on Bibsonomy Graphs Comb. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
13Zsolt Tuza, Annegret Wagler Minimally Non-Preperfect Graphs of Small Maximum Degree. Search on Bibsonomy Graphs Comb. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
13Peter A. Fejer, Richard A. Shore Every incomplete computably enumerable truth-table degree is branching. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 03D30, 03D25
13Marek Karpinski Approximating Bounded Degree Instances of NP-Hard Problems. Search on Bibsonomy FCT The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
13Alantha Newman The Maximum Acyclic Subgraph Problem and Degree-3 Graphs. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
13Luca Trevisan Non-approximability results for optimization problems on bounded degree instances. Search on Bibsonomy STOC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
13Noga Alon, Richard Beigel Lower Bounds for Approximations by Low Degree Polynomials Over Zm. Search on Bibsonomy CCC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
13Frank Dachille, Arie E. Kaufman High-Degree Temporal Antialiasing. Search on Bibsonomy CA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
13David S. L. Wei, Felix P. Muga II, Kshirasagar Naik Isomorphism of Degree Four Cayley Graph and Wrapped Butterfly and Their Optimal Permutation Routing Algorithm. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF wrapped butterfly, Cayley graph, isomorphism, permutation routing
13David Brown 0004, Jianfeng Feng Effects of Correlation and Degree of Balance in Random Synaptic Inputs on the Output of the Hodgkin-Huxley Model. Search on Bibsonomy IWANN (1) The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
13David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman 0001 Representing Trees of Higer Degree. Search on Bibsonomy WADS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
13Gerald W. Schuster A Minimum Degree Result for Disjoint Cycles and Forests in Graphs. Search on Bibsonomy Comb. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 05C05, 05C35, 05C38
13Hong Wang 0005 Vertex-Disjoint Triangles in Claw-Free Graphs with Minimum Degree at Least Three. Search on Bibsonomy Comb. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 05C35, 05C70
Displaying result #701 - #800 of 25155 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license