The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase in-degree (changed automatically) 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
51Hong-Zhong Huang, Ye Tao, Yu Liu 0006 Multidisciplinary collaborative optimization using fuzzy satisfaction degree and fuzzy sufficiency degree model. Search on Bibsonomy Soft Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Collaborative optimization, Fuzzy satisfaction degree, Fuzzy sufficiency degree, Multidisciplinary design optimization
51Lap Chi Lau, Mohit Singh Additive approximation for bounded degree survivable network design. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF approximation algorithms, steiner tree, bounded degree, iterative rounding, survivable network design
47David J. Pritchard, Denis A. Nicole Cube Connected Mobius Ladders: An Inherently Deadlock-Free Fixed Degree Network. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF deadlock-free fixed degree network, cube-connected Mobius ladders, deadlock-free routingstrategy, fixed node degree, fixed degree topology of size, transputernetworks, parallel algorithms, computational complexity, graph theory, topology, Cayley graph, multiprocessorinterconnection network, network diameter, multiprocessor interconnectionnetworks, interval routing
44Andrea Francke, Michael Hoffmann 0001 The Euclidean degree-4 minimum spanning tree problem is NP-hard. Search on Bibsonomy SCG The full citation details ... 2009 DBLP  DOI  BibTeX  RDF degree-constricted graphs, degree-restricted graphs, np-complete, reduction, spanning trees, geometric optimization, geometric graphs, bounded-degree graphs
44Tao Li, Xiao Ciyuan Research of Group Decision Consensus Degree Based on Extended Intuitionistic Fuzzy Set. Search on Bibsonomy ICFIE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF extended intuitionistic fuzzy sets, intuitionistic fuzzy distance, consensus degree, average consensus degree, relative consensus degree
44Ming Li, De-San Yang Application of Discrimination Degree for Attributes Reduction in Concept Lattice. Search on Bibsonomy PAKDD The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Inclusion degree, Discrimination degree, Concept lattice, Attributes reduction
42Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Kong Yung Degree Bounded Network Design with Metric Costs. Search on Bibsonomy FOCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
42Nikhil Bansal 0001, Rohit Khandekar, Viswanath Nagarajan Additive guarantees for degree bounded directed network design. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF approximation algorithms, directed graphs, network design
40Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh 0001 Degree-Constrained Subgraph Problems: Hardness and Approximation Results. Search on Bibsonomy WAOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Degree-Constrained Subgraphs, Apx, Excluded Minor, Approximation Algorithms, Hardness of Approximation, PTAS
40Mário M. Freire, Joel J. P. C. Rodrigues, Rui M. F. Coelho The Role of Network Topologies in the Optical Core of IP-over-WDM Networks with Static Wavelength Routing. Search on Bibsonomy Telecommun. Syst. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF optical Internet, routing, network topologies, optical networks
39Joel J. P. C. Rodrigues, Mário M. Freire, Pascal Lorenz Performance Implications of Meshing Degree for Optical Burst Switched Networks Using One-Way Resource Reservation Protocols. Search on Bibsonomy Telecommun. Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF optical internet, performance, optical burst switching, resource reservation protocols
39Joel J. P. C. Rodrigues, Mário M. Freire, Pascal Lorenz The Role of Meshing Degree in Optical Burst Switching Networks Using Signaling Protocols with One-Way Reservation Schemes. Search on Bibsonomy ICN (1) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
36Anthony J. Dunlop, Marian Boykan Pour-El The Degree of Unsolvability of a Real Number. Search on Bibsonomy CCA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
36Thomas Fritz 0001, Jingwen Ou, Gail C. Murphy, Emerson R. Murphy-Hill A degree-of-knowledge model to capture source code familiarity. Search on Bibsonomy ICSE (1) The full citation details ... 2010 DBLP  DOI  BibTeX  RDF degree-of-knowledge, onboarding, interaction, recommendation, expertise, authorship, degree-of-interest
36Sanjeev Arora, Kevin L. Chang Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problems. Search on Bibsonomy Algorithmica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Degree-Restricted Minimum Spanning Tree, Low degree, Approximation algorithm
35Mohit Singh, Lap Chi Lau Approximating minimum bounded degree spanning trees to within one of optimal. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF approximation algorithm, spanning trees, bounded degree, iterative rounding
35Dana Moshkovitz, Ran Raz Sub-constant error low degree test of almost-linear size. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF plane vs. point test, probabilistically checkable proofs, locally testable codes, low degree testing
35Navaratnasothie Selvakkumaran, Phiroze N. Parakh, George Karypis Perimeter-degree: a priori metric for directly measuring and homogenizing interconnection complexity in multilevel placement. Search on Bibsonomy SLIP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF interconnection complexity, multilevel global placement, nonhomogeneity, perimeter-degree, congestion, routability
35Jochen Könemann, R. Ravi 0001 Primal-dual meets local search: approximating MST's with nonuniform degree bounds. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF degree-bounded spanning trees, approximation algorithms, spanning trees, network algorithms, bicriteria approximation
35Hongsuda Tangmunarunkit, Ramesh Govindan, Sugih Jamin, Scott Shenker, Walter Willinger Network topology generators: degree-based vs. structural. Search on Bibsonomy SIGCOMM The full citation details ... 2002 DBLP  DOI  BibTeX  RDF degree-based generators, large-scale structure, structural generators, topology characterization, topology metrics, network topology, hierarchy, topology generators
34Yushin Cho, William A. Pearlman Quantifying the Coding Performance of Zerotrees of Wavelet Coefficients: Degree-k Zerotree. Search on Bibsonomy IEEE Trans. Signal Process. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
32Maria Jump, Kathryn S. McKinley Dynamic shape analysis via degree metrics. Search on Bibsonomy ISMM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF degree metrics, dynamic invariants, dynamic shape analysis
32QianQian Hu, GuoJin Wang A novel algorithm for explicit optimal multi-degree reduction of triangular surfaces. Search on Bibsonomy Sci. China Ser. F Inf. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF triangular Bézier surface, multi-degree reduction, Jacobi polynomial, L 2 norm, computer aided design, data compression, Bernstein polynomial
32Alexandra A. Soskova A Jump Inversion Theorem for the Degree Spectra. Search on Bibsonomy CiE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF enumeration degrees, degree spectra, Marker’s extensions, enumerations
32Thang Nguyen Bui, Catherine M. Zrncic An ant-based algorithm for finding degree-constrained minimum spanning tree. Search on Bibsonomy GECCO The full citation details ... 2006 DBLP  DOI  BibTeX  RDF degree constrained spanning tree, ant algorithm
32Manimegalai M. Subramaniam The emergence of IT degree programs: when did it happen? Search on Bibsonomy SIGITE Conference The full citation details ... 2005 DBLP  DOI  BibTeX  RDF IT degree programs, emergence of IT education, IT curricula
32Enes Pasalic Degree Optimized Resilient Boolean Functions from Maiorana-McFarland Class. Search on Bibsonomy IMACC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Boolean Function, Resiliency, Nonlinearity, Algebraic Degree
32Yu Wang 0003, Xiang-Yang Li 0001 Localized construction of bounded degree and planar spanner for wireless ad hoc networks. Search on Bibsonomy DIALM-POMC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF wireless ad hoc networks, topology control, localized algorithm, spanner, planar, bounded degree
32Michael J. Docherty, Peter Sutton, Margot Brereton, Simon M. Kaplan, Allison Brown The information environments program - a new design based IT degree. Search on Bibsonomy ACSE The full citation details ... 2000 DBLP  DOI  BibTeX  RDF design-based IT degree, information environments, studio-based learning, curriculum
32Wolfgang Merkle, Frank Stephan 0001 On C-Degrees, H-Degrees and T-Degrees. Search on Bibsonomy CCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
31Joel J. P. C. Rodrigues, Mário M. Freire, Pascal Lorenz Performance Assessment of Optical Burst Switched Degree-Four Chordal Ring Networks. Search on Bibsonomy ICT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
31Hyunwoo Chun, Haewoon Kwak, Young-Ho Eom, Yong-Yeol Ahn, Sue B. Moon, Hawoong Jeong Comparison of online social relations in volume vs interaction: a case study of cyworld. Search on Bibsonomy Internet Measurement Conference The full citation details ... 2008 DBLP  DOI  BibTeX  RDF cyworld, degree correlation, friend relationship, guestbook log, k-core, reciprocity, online social network, disparity, degree distribution, clustering coefficient, network motif
30Shao Liu, Minghua Chen 0001, Sudipta Sengupta, Mung Chiang, Jin Li 0001, Philip A. Chou P2P Streaming Capacity under Node Degree Bound. Search on Bibsonomy ICDCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF P2P Streaming Capacity, Node Degree Bound, Node Out-Degree Bound, P2P Streaming
30Mihir K. Chakraborty, Pulak Samanta Consistency-Degree Between Knowledges. Search on Bibsonomy RSEISP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF elementary category, dependency degree, consistency degree, Rough Sets, knowledge
30Omer Reingold, Salil P. Vadhan, Avi Wigderson Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors. Search on Bibsonomy FOCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF entropy waves, zig-zag graph product, constant-degree expanders, constant-degree extractors, constructive interference, explicit extractors, high min-entropy sources, eigenvalue bound, graph theory, probability, entropy, probability distributions, eigenvalues and eigenfunctions
30Roman Smolensky On Representations by Low-Degree Polynomials Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF many-output function, boolean cube, nonzeroes, Hilbert function, projective space, low-degree polynomials, low-degree polynomial
29João M. Fernandes, Ricardo Jorge Machado 0001 A Two-Year Software Engineering M.Sc. Degree Designed Under the Bologna Declaration Principles. Search on Bibsonomy ICSEA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Bologna declaration, master degree, project-led engineering education, Software engineering
29Franz-Josef Brandenburg The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree. Search on Bibsonomy RTA The full citation details ... 1991 DBLP  DOI  BibTeX  RDF boundary and confluent graph grammars, operator normal form, graph languages of bounded degree, graph grammars
29Tamás Király, Lap Chi Lau, Mohit Singh Degree Bounded Matroids and Submodular Flows. Search on Bibsonomy IPCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
29Mário M. Freire, Rui M. F. Coelho, Joel J. P. C. Rodrigues The Role of Nodal Degree in the Optical Core of IP-over-WDM Networks. Search on Bibsonomy ISCC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
29Rui M. F. Coelho, Joel J. P. C. Rodrigues, Mário M. Freire Performance Analysis of Degree Four Topologies for the Optical Core of IP-over-WDM Networks. Search on Bibsonomy ICOIN The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
28Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis Self-stabilizing minimum-degree spanning tree within one from the optimal degree. Search on Bibsonomy IPDPS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
27Kun Liu 0001, Evimaria Terzi Towards identity anonymization on graphs. Search on Bibsonomy SIGMOD Conference The full citation details ... 2008 DBLP  DOI  BibTeX  RDF degree sequence, dynamic programming, anonymity
27Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz Resource Allocation in Bounded Degree Trees. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Bounded degree trees, Scheduling, Approximation algorithms, Bandwidth allocation, Storage allocation
27Zhenting Hou, Xiangxing Kong, Dinghua Shi, Guanrong Chen, Qinggui Zhao Degree-Distribution Stability of Growing Networks. Search on Bibsonomy Complex (2) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF growing network Markov chains, BA model, scale-free, degree distribution
27Shachar Lovett Unconditional pseudorandom generators for low degree polynomials. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF fourier analysis, pseudorandom generators, low degree tests
27Quansheng Dou, Zhijun Yu, Zhongzhi Shi, Erkeng Yu, Yongzhi Zheng Cluster-Degree Analysis and Velocity Compensation Strategy of PSO. Search on Bibsonomy ISICA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF cluster-degree, particle swarm optimization, convergence property
27Tao Wan, Malgorzata Chrzanowska-Jeske Prediction of interconnect net-degree distribution based on Rent's rule. Search on Bibsonomy SLIP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF net-degree distribution, Rent's rule, interconnect prediction
27Guillermo De Ita Luna Polynomial Classes of Boolean Formulas for Computing the Degree of Belief. Search on Bibsonomy IBERAMIA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF #SAT Problem, Updating Beliefs, Approximate Reasoning, Degree of Belief
27Michael S. Floater, Tom Lyche Asymptotic convergence of degree-raising. Search on Bibsonomy Adv. Comput. Math. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF degree-raising, Voronovskaya estimates, 65B17, 65D05, 41A25, 41A10, Bernstein polynomials
27Paola Alimonti, Tiziana Calamoneri Improved Approximations of Independent Dominating Set in Bounded Degree Graphs. Search on Bibsonomy WG The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Minimum Independent Dominating Set, Approximation Algorithms, Local Search, Greedy, Regular Graphs, Cubic Graphs, Bounded Degree Graphs
27Joseph W. H. Liu Modification of the Minimum-Degree Algorithm by Multiple Elimination. Search on Bibsonomy ACM Trans. Math. Softw. The full citation details ... 1985 DBLP  DOI  BibTeX  RDF minimum degree, sparse ordering, ordering, elimination
26Willi Meier, Enes Pasalic, Claude Carlet Algebraic Attacks and Decomposition of Boolean Functions. Search on Bibsonomy EUROCRYPT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
26Kai-di Liu, Jin Wang, Yan-jun Pang, Jin Liu, Jun-hu Ruan The Mathematic Method of Membership Conversion from Degree of Coordinates to Degree of Points. Search on Bibsonomy ESIAT (2) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF multi-indexes decision, membership degree conversion, distinguishable weight, valid values, membership function
26Kamalika Chaudhuri, Satish Rao, Samantha J. Riesenfeld, Kunal Talwar What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Approximation algorithms, Combinatorial optimization, Matching, Minimum spanning trees
26Claus Diem An Index Calculus Algorithm for Plane Curves of Small Degree. Search on Bibsonomy ANTS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
26James F. Lynch Convergence law for random graphs with specified degree sequence. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF random graphs, Finite model theory
26Dimitris Achlioptas, Aaron Clauset, David Kempe 0001, Cristopher Moore On the bias of traceroute sampling: or, power-law degree distributions in regular graphs. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF internet mapping, random graphs, power laws
26James F. Lynch Convergence Law for Random Graphs with Specified Degree Sequence. Search on Bibsonomy LICS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
26Gabriel Robins, Jeffrey S. Salowe On the Maximum Degree of Minimum Spanning Trees. Search on Bibsonomy SCG The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
26Congjun Rao, Jin Peng, Wenlue Chen Novel Method for Fuzzy Hybrid Multiple Attribute Decision Making. Search on Bibsonomy ICFIE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Fuzzy hybrid multiple attribute decision making, Grey relational degree, Approach degree, Fuzzy number, Interval number
25Martin Fürer, Balaji Raghavachari Approximating the Minimum Degree Spanning Tree to Within One from the Optimal Degree. Search on Bibsonomy SODA The full citation details ... 1992 DBLP  BibTeX  RDF
25Zhengping He, Hongtao Zhou, Wei Zeng 0009, Yushuo Chen, Qi Fei Research on Coordination Model of Multiplexed System Based on DEA. Search on Bibsonomy ISNN (1) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Coordination Degree, Data Envelopment Analysis (DEA), Multiplexed System
25Makoto Ichii, Makoto Matsushita, Katsuro Inoue An Exploration of Power-Law in Use-Relation of Java Software Systems. Search on Bibsonomy Australian Software Engineering Conference The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Software Component Graph, Power-law, Scale-free Network, Degree Distribution
25Ching-Hsien Hsu, Shih-Chang Chen, Chao-Yang Lan Scheduling contention-free irregular redistributions in parallelizing compilers. Search on Bibsonomy J. Supercomput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Irregular redistribution, GEN_BLOCK, Parallelizing compiler, Communication scheduling, Degree-reduction
25Frédéric Didier, Jean-Pierre Tillich Computing the Algebraic Immunity Efficiently. Search on Bibsonomy FSE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Low degree multiple, Boolean functions, Stream ciphers, Algebraic attacks, Algebraic immunity, Annihilator
25Liangbin Wang, Guojin Zhu Developing an XML Schema of BWW Ontologies for Semantic Web. Search on Bibsonomy ISPAN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF higher-degree relation, Semantic Web, ontological constructs, Web modeling
24Myoungsu Cho, Bo Hyoung Kim, Dong Kyun Jeong, Yeong-Gil Shin, Jinwook Seo Dynamic query interface for spatial proximity query with degree-of-interest varied by distance to query point. Search on Bibsonomy CHI The full citation details ... 2010 DBLP  DOI  BibTeX  RDF dynamic query interface, spatial proximity query, tab interface, visual information seeking, degree-of-interest
24Roy Friedman, Alex Kogan Brief announcement: deterministic dominating set construction in networks with bounded degree. Search on Bibsonomy PODC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF dominating sets, bounded degree graphs, distributed approximation algorithms
24Takuro Fukunaga, Hiroshi Nagamochi Network Design with Edge-Connectivity and Degree Constraints. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Degree constraint, (m,n)-VRP, Approximation algorithm, TSP, Vehicle routing problem, Edge-connectivity
24Xiaojun Zhang, Zheng He A More Strict Definition of Steady State Degree Distribution. Search on Bibsonomy Complex (2) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Steady state degree distribution, evolving network, stochastic process
24Noriaki Kawamae, Hitoshi Sakano, Takeshi Yamada Personalized recommendation based on the personal innovator degree. Search on Bibsonomy RecSys The full citation details ... 2009 DBLP  DOI  BibTeX  RDF personal innovator degree, purchase innovator, personalization, collaborative filtering, recommendation, serendipity
24Aileen Zhang, Chu-Wee Lim, Khoongming Khoo, Lei Wei 0001, Josef Pieprzyk Extensions of the Cube Attack Based on Low Degree Annihilators. Search on Bibsonomy CANS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Cube Attack, Low-Degree Annihilators, Algebraic Attack
24Huynh Thi Thanh Binh, Truong Binh Nguyen New Particle Swarm Optimization Algorithm for Solving Degree Constrained Minimum Spanning Tree Problem. Search on Bibsonomy PRICAI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF degree constrained minimum spanning tree, genetic algorithm, particle swarm optimization, swarm intelligent
24Gang Xu 0001, Guozhao Wang Parametric Polynomial Minimal Surfaces of Degree Six with Isothermal Parameter. Search on Bibsonomy GMP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF harmonic surfaces, isothermal parametric surface, parametric polynomial minimal surface of degree six, membrane structure, minimal surface
24Fachao Li 0001, Chenxia Jin Fuzzy Genetic Algorithm Based on Principal Operation and Inequity Degree. Search on Bibsonomy ICIC (2) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF fuzzy inequity degree, principal index, BPO&ID-FGA, Markov chain, Fuzzy optimization, fuzzy genetic algorithm
24Yang Wang It is time for a computer application degree. Search on Bibsonomy ACM SIGCSE Bull. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF degree programs, curriculum, computer science, computer applications
24Yu Wang 0003, Xiang-Yang Li 0001 Localized Construction of Bounded Degree and Planar Spanner for Wireless Ad Hoc Networks. Search on Bibsonomy Mob. Networks Appl. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Wireless ad hoc networks, topology control, localized algorithm, spanner, planar, bounded degree
24Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid Constructing Plane Spanners of Bounded Degree and Low Weight. Search on Bibsonomy Algorithmica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Low weight graphs, Computational geometry, Planar graphs, Spanners, Bounded degree graphs
24Sonia Pérez-Díaz, J. Rafael Sendra Partial degree formulae for rational algebraic surfaces. Search on Bibsonomy ISSAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF partial degrees of an algebraic surface, rational map degree, rational surface parametrization, algebraic surface
24Hossein Hajiabolhassan, Xuding Zhu Sparse H-Colourable Graphs of Bounded Maximum Degree. Search on Bibsonomy Graphs Comb. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Uniquely H-colourable graphs, Bounded maximum degree, Girth
24Lidan Shou, Zhiyong Huang, Kian-Lee Tan The Hierarchical Degree-of-Visibility Tree. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Degree of visibility, HDoV-tree, performance and visual fidelity, virtual environment, level-of-details
24Lélia Blin, Franck Butelle The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs. Search on Bibsonomy IPDPS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Minimum degree spanning trees, Distributed algorithms, Spanning trees, Asynchronous algorithms, general graphs
24Navaratnasothie Selvakkumaran, George Karypis Multi.Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization. Search on Bibsonomy ICCAD The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Maximum Subdomain Degree, Partitioning, Placement, Congestion
24Ryan O'Donnell, Rocco A. Servedio New degree bounds for polynomial threshold functions. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF ptfs, learning, lower bounds, polynomials, duality, degree, formulas, polynomial threshold functions
24Eli Ben-Sasson, Madhu Sudan 0001, Salil P. Vadhan, Avi Wigderson Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF property testing, probabilistically checkable proofs, locally testable codes, linearity testing, low degree testing
24D. Dijkstra Doubling the Degree of Precision Without Doubling the Grid When Solving a Differential Equation with a Pseudo-Spectral Collocation Method. Search on Bibsonomy J. Sci. Comput. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF double collocation, double precision degree, pseudo-spectral collocation, differentiation matrices, Hermite interpolation
24Li-Jen Mao, Sheau-Dong Lang Parallel Algorithms for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains and the Heap-Traversal Technique. Search on Bibsonomy ICPP Workshops The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Parallel approximate algorithm, degree-constrained minimum spanning tree, nearest neighbor chain, heap traversal
24I. Ben Salah, Pascal Maroni The connection between self-associated two-dimensional vector functionals and third degree forms. Search on Bibsonomy Adv. Comput. Math. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Stieltjes functions, third degree forms, Laguerre-Hahn polynomials, 2-orthogonal polynomials, integral representations, 42C05, 33C45
24Manfred Göbel Rewriting Techniques and Degree Bounds for Higher Order Symmetric Polynomials. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Higher order symmetry, Degree bounds, Rewriting techniques, Generators, Symmetric polynomials
24Li-Jen Mao, Narsingh Deo, Sheau-Dong Lang A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains. Search on Bibsonomy ISPAN The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Parallel approximate algorithm, degree-constrained MST, reciprocal nearest neighbors, minimum spanning tree
24Satoshi Kimura, Masahiko Yachida Facial Expression Recognition and Its Degree Estimatio. Search on Bibsonomy CVPR The full citation details ... 1997 DBLP  DOI  BibTeX  RDF Degree of facial expression, Variation from expressionless face, Potential Net Model, K-L expansion, Facial expression recognition, Emotion Space
24Premkumar Vadapalli, Pradip K. Srimani A New Family of Cayley Graph Interconnection Networks of Constant Degree Four. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF constant degree, simple routing, fault tolerance, Interconnection network, generators, Cayley graph, optimal routing
24Jiang Liu 0002, Guohua Wu Joining to High Degrees. Search on Bibsonomy CiE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
24Joel J. P. C. Rodrigues, Mário M. Freire, Pascal Lorenz One-Way Resource Reservation Protocols for IP Over Optical Burst Switched Mesh Networks. Search on Bibsonomy Systems Communications The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
24Hettihe P. Dharmasena, Ramachandran Vaidyanathan Lower Bounds on the Loading of Multiple Bus Networks for Binary Tree Algorithms. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Multiple bus networks, binary tree algorithms, bus loading, interconnection networks, lower bounds
23Jin Fan, David J. Hill 0001 Enhancement of Synchronizability of the Kuramoto Model with Assortative Degree-Frequency Mixing. Search on Bibsonomy Complex (2) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Kuramoto model, assortative, synchronization, correlation
23Jianhong Ke, Xiaoshuang Chen Degree Distribution of a Two-Component Growing Network. Search on Bibsonomy Complex (2) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF growing network, rate equation approach, connectivity, scale-free
23Ido Ben-Eliezer, Rani Hod, Shachar Lovett Random Low Degree Polynomials are Hard to Approximate. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
23S. Barry Cooper, Angsheng Li On Lachlan's major sub-degree problem. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) Primary 03D25, Secondary 03D35, 03D30
Displaying result #1 - #100 of 25155 (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 L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license