The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase minimum weight (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1976-1987 (17) 1988-1990 (19) 1991-1993 (21) 1994-1995 (17) 1996 (18) 1997 (16) 1998 (22) 1999-2000 (27) 2001 (24) 2002 (20) 2003-2004 (34) 2005 (39) 2006 (37) 2007 (33) 2008 (38) 2009 (32) 2010-2011 (22) 2012 (3)
Publication types (Num. hits)
article(182) incollection(3) inproceedings(254)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 278 occurrences of 216 keywords

Results
Found 439 publication records. Showing 439 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
4Stefan Porschen Counting All Solutions of Minimum Weight Exact Satisfiability. Search on Bibsonomy CIAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Minimum weight exact satisfiability, minimum weight set partition, counting problem, maximum weight independent set
3Jan Remy, Angelika Steger A quasi-polynomial time approximation scheme for minimum weight triangulation. Search on Bibsonomy J. ACM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF approximation algorithms, Minimum weight triangulation
3Chang Woo Pyo, Mikio Hasegawa Minimum weight routing based on a common link control radio for cognitive wireless ad hoc networks. Search on Bibsonomy IWCMC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF common link control radio, minimum weight routing, wireless ad hoc, cognitive, neighbor discovery
3Jan Remy, Angelika Steger A quasi-polynomial time approximation scheme for minimum weight triangulation. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF approximation algorithms, minimum weight triangulation
3Criel Merino, Gelasio Salazar, Jorge Urrutia On the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Minimum weight perfect matchings, Perfect matchings, Geometric graphs
3Stefan Porschen Solving Minimum Weight Exact Satisfiability in Time O(20.2441n). Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF minimum weight exact satisfiability, branching tree, minimum perfect matching, NP-completeness, exact algorithm
3Shyong Jian Shyu, Peng-Yeng Yin, Bertrand M. T. Lin An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem. Search on Bibsonomy Annals OR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF minimum weight vertex cover, meta-heuristic algorithm, ant colony optimization
3T. Aaron Gulliver, Masaaki Harada On the Minimum Weight of Codes over F5 Constructed from Certain Conference Matrices. Search on Bibsonomy Des. Codes Cryptography The full citation details ... 2004 DBLP  DOI  BibTeX  RDF minimum weight, conference matrix, code
3Meinolf Sellmann An Arc-Consistency Algorithm for the Minimum Weight All Different Constraint. Search on Bibsonomy CP The full citation details ... 2002 DBLP  BibTeX  RDF all different constraint, minimum weight all different constraint, MinWeightAllDiff, IlcAllDiffCost, optimization constraint, cost based filtering
3Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang Triangulations without Minimum-Weight Drawing. Search on Bibsonomy CIAC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Graph drawing, Minimum-weight triangulation
3Juan A. Garay, Shay Kutten, David Peleg A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees (Extended Abstract) Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF distributed minimum-weight spanning tree algorithm, sublinear time distributed algorithm, minimum-weight spanning trees, global network problems, n-vertex network, Diam, edge elimination techniques, time complexity, graph decomposition
2Wolfgang Mulzer, Günter Rote Minimum-weight triangulation is NP-hard. Search on Bibsonomy J. ACM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Optimal triangulations, PLANAR 1-IN-3-SAT
2Ding-Zhu Du Double Partition: (6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs. Search on Bibsonomy AAIM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Xiaofeng Gao, Yaochun Huang, Zhao Zhang, Weili Wu (6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs. Search on Bibsonomy COCOON The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Approximation algorithm, Dominating Set, Unit Disk Graph
2Naoyuki Kamiyama, Naoki Katoh The Minimum Weight In-Tree Cover Problem. Search on Bibsonomy MCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Maxim A. Babenko An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Walter Kern, Gerhard J. Woeginger Quadratic programming and combinatorial minimum weight product problems. Search on Bibsonomy Math. Program. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 90C20, 90C27, 90C26
2Jennifer D. Key, Fidele F. Ngwane A lower bound for the minimum weight of the dual 7-ary code of a projective plane of order 49. Search on Bibsonomy Des. Codes Cryptography The full citation details ... 2007 DBLP  DOI  BibTeX  RDF AMS Classifications 05, 51, 94
2Bodo Manthey Minimum-Weight Cycle Covers and Their Approximability. Search on Bibsonomy WG The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Vladimir G. Deineko, Alexandre Tiskin Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP. Search on Bibsonomy WEA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Christian Knauer, Andreas Spillner A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators. Search on Bibsonomy WG The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
2Wolfgang Mulzer, Günter Rote Minimum weight triangulation is NP-hard. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2006 DBLP  DOI  BibTeX  RDF PLANAR-1-IN-3-SAT, optimal triangulations
2Christoph Ambühl, Thomas Erlebach, Matús Mihalák, Marc Nunkesser Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
2Walter Kern, Gerhard J. Woeginger Quadratic Programming and Combinatorial Minimum Weight Product Problems. Search on Bibsonomy CIAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF shortest path, Quadratic Programming, approximation scheme
2Eva K. Lee, Todd Easton, Kapil Gupta Novel evolutionary models and applications to sequence alignment problems. Search on Bibsonomy Annals OR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Evolutionary distance problem, Minimum weight common mutated sequence, Node-packing polytope, Multiple sequence alignment, DNA sequencing, Sequence comparison, Conflict graph, Supernode, Phylogenetic analysis
2Zvi Lotker, Boaz Patt-Shamir, David Peleg Distributed MST for constant diameter graphs. Search on Bibsonomy Distributed Computing The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Minimum-weight spanning tree, Distributed algorithm
2Magdalene Grantson, Christian Borgelt, Christos Levcopoulos Minimum Weight Triangulation by Cutting Out Triangles. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
2Jing Lei, Roy D. Yates, Larry J. Greenstein, Hang Liu Wireless Link SNR Mapping Onto An Indoor Testbed. Search on Bibsonomy TRIDENTCOM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Indoor Testbed, Minimum Weight Matching, SNR, Path Loss, Downlink
2Béla Bollobás, David Gamarnik, Oliver Riordan, Benny Sudakov On the Value of a Random Minimum Weight Steiner Tree. Search on Bibsonomy Combinatorica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C80, 68R10, 60C05
2Hajo Broersma, Daniël Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger The Computational Complexity of the Minimum Weight Processor Assignment Problem. Search on Bibsonomy WG The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
2Mikkel Sigurd, Martin Zachariasen Construction of Minimum-Weight Spanners. Search on Bibsonomy ESA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
2Michael Hoffmann, Yoshio Okamoto The Minimum Weight Triangulation Problem with Few Inner Points. Search on Bibsonomy IWPEC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
2Joachim Gudmundsson, Christos Levcopoulos Minimum Weight Pseudo-Triangulations. Search on Bibsonomy FSTTCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
2Alessandro Ferrante, Mimmo Parente An Approximation Algorithm for the Minimum Weight Vertex-Connectivity Problem in Complete Graphs with Sharpened Triangle Inequality. Search on Bibsonomy ICTCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
2Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach. Search on Bibsonomy ICTCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Directed hypergraph, minimum weight hyperpath, dynamic algorithm, AND/OR graph
2William Lenhart, Giuseppe Liotta Minimum Weight Drawings of Maximal Triangulations (Extended Abstract). Search on Bibsonomy Graph Drawing The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
2Boris Aronov, Steven Fortune Approximating Minimum-Weight Triangulations in Three Dimensions. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
2Cao An Wang, Bo-Ting Yang A Tight Bound for ß-SKeleton of Minimum Weight Triangulations. Search on Bibsonomy WADS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
2David Peleg Distributed Matroid Basis Completion via Elimination Upcast and Distributed Correction of Minimum-Weight Spanning Trees. Search on Bibsonomy ICALP The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
2Kerry Capp, Bryant A. Julstrom A weight-coded genetic algorithm for the minimum weight triangulation problem. Search on Bibsonomy SAC The full citation details ... 1998 DBLP  DOI  BibTeX  RDF the minimum weight triangulation problem, weighted codings, computational geometry, triangulations
2Matthew Dickerson, J. Mark Keil, Mark H. Montague A Large Subgraph of the Minimum Weight Triangulation. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
2Vincenzo Auletta, Domenico Parente Better Algorithms for Minimum Weight Vertex-Connectivity Problems. Search on Bibsonomy STACS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
2Horng-Ren Tsai, Shi-Jinn Horng, Shun-Shan Tsai, Tzong-Wann Kao, Shung-Shing Lee Solving an Algebraic Path Problem and Some Related Graph Problems on a Hyper-Bus Broadcast Network. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF Hyper-bus broadcast network, matrix multiplication operation, minimum-weight spanning tree, parallel algorithm, graph theory, connectivity, transitive closure, connected component, bridge, biconnected component, all-pair shortest paths, articulation point, algebraic path problem
2Cao An Wang, Francis Y. L. Chin, Yin-Feng Xu A New Subgraph of Minimum Weight Triangulations. Search on Bibsonomy ISAAC The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
2Bo-Ting Yang, Yin-Feng Xu, Zhao-yong You A Chain Decomposition Algorithm for the Proof of a Property on Minimum Weight Triangulations. Search on Bibsonomy ISAAC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF algorithm, computational geometry, triangulation, Chain
2N. W. Holloway, Somasundaram Ravindran, Alan Gibbons Approximating Minimum Weight Perfect Matchings for Complete Graphs Satisfying the Triangle Inequality. Search on Bibsonomy WG The full citation details ... 1993 DBLP  DOI  BibTeX  RDF parallel algorithms, approximation algorithms, matching
2David Eppstein Approximating the Minimum Weight Triangulation. Search on Bibsonomy SODA The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
2Jason S. J. Chen, Victor O. K. Li Optimizing Joins in Fragmented Database Systems on a Broadcast Local Network. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF fragmented database systems, broadcast local network, minimum-weight vertex cover, join-analysis graph, parallelism, relational databases, distributed databases, concurrency control, redundancy, local area networks, NP hardness, relations
1Wenkai Ma, Deying Li, Zhao Zhang Algorithms for the minimum weight k-fold (connected) dominating set problem. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Salim Bouamama, Christian Blum, Abdellah Boukerram A population-based iterated greedy algorithm for the minimum weight vertex cover problem. Search on Bibsonomy Appl. Soft Comput. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Arman Yousefi, Neal E. Young On a linear program for minimum-weight triangulation. Search on Bibsonomy SODA The full citation details ... 2012 DBLP  BibTeX  RDF
1Masaaki Harada, Tsuyoshi Miezaki An upper bound on the minimum weight of Type II Z2k-codes. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach Approximation of minimum weight spanners for sparse graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Raka Jovanovic, Milan Tuba An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem. Search on Bibsonomy Appl. Soft Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Adrian Dumitrescu, Csaba D. Tóth Minimum Weight Convex Steiner Partitions. Search on Bibsonomy Algorithmica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Maxim A. Babenko An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem. Search on Bibsonomy Algorithmica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Teresa Sousa Minimum Weight H-Decompositions of Graphs: The Bipartite Case. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2011 DBLP  BibTeX  RDF
1Liam Roditty, Virginia Vassilevska Williams Minimum Weight Cycles and Triangles: Equivalences and Algorithms Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Arman Yousefi, Neal E. Young On a Linear Program for Minimum-Weight Triangulation Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1David A. Bader, Guojing Cong Spanning Tree, Minimum Weight. Search on Bibsonomy Encyclopedia of Parallel Computing The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels A primal algorithm for the minimum weight clique cover problem on a class of claw-free perfect graphs. Search on Bibsonomy CTW The full citation details ... 2011 DBLP  BibTeX  RDF
1Liam Roditty, Virginia Vassilevska Williams Minimum Weight Cycles and Triangles: Equivalences and Algorithms. Search on Bibsonomy FOCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Gerhard Reinelt, Klaus Michael Wenger Generating partitions of a graph into a fixed number of minimum weight cuts. Search on Bibsonomy Discrete Optimization The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Shiyan Hu A new asymmetric inclusion region for minimum weight triangulation. Search on Bibsonomy J. Global Optimization The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Louigi Addario-Berry, Nicolas Broutin, Gábor Lugosi The Longest Minimum-Weight Path in a Complete Graph. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Min-Zheng Shieh, Shi-Chun Tsai On the minimum weight problem of permutation codes under Chebyshev distance Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Victor Alvarez, Raimund Seidel Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric. Search on Bibsonomy Comput. Geom. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Tetsushi Masuno, Toru Fujiwara, Takuya Kusaka A New method to reduce the probability of detection errors for a digital watermark using complementary decoding algorithms and minimum weight codewords of linear code. Search on Bibsonomy ISITA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Min-Zheng Shieh, Shi-Chun Tsai On the minimum weight problem of permutation codes under Chebyshev distance. Search on Bibsonomy ISIT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Edoardo Amaldi, Bernard Fortz, Claudio Iuliano On Finding a Minimum Weight Cycle Basis with Cycles of Bounded Length. Search on Bibsonomy CTW The full citation details ... 2010 DBLP  BibTeX  RDF
1Erkan Dogan, Ferhat Erdal, Mehmet Polat Saka Optimum design of grillage systems under code provisions using particle swarm optimization. Search on Bibsonomy GECCO The full citation details ... 2010 DBLP  DOI  BibTeX  RDF grillage systems, minimum weight, optimum structural design, particle swarm optimization, combinatorial optimization, search technique
1Ambreen Shahnaz, Thomas Erlebach Approximating fault-tolerant Steiner subgraphs in heterogeneous wireless networks. Search on Bibsonomy IWCMC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF 2-edge-connected Steiner subgraph, quasi unit disk graph, unit disk graph
1Matti Åstrand, Jukka Suomela Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks. Search on Bibsonomy SPAA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF edge packing, distributed algorithm, local algorithm, set cover, vertex cover, anonymous network
1Jennifer D. Key, T. P. McDonough, Vassili C. Mavron An upper bound for the minimum weight of the dual codes of desarguesian planes. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Martin Grüttmüller, Sven Hartmann, Thomas Kalinowski, Uwe Leck, Ian T. Roberts Maximal Flat Antichains of Minimum Weight. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2009 DBLP  BibTeX  RDF
1Masaaki Harada, Tsuyoshi Miezaki An Upper Bound on the Minimum Weight of Type II ZZ2k-Codes Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bettina Speckmann On minimum weight pseudo-triangulations. Search on Bibsonomy Comput. Geom. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Bodo Manthey Minimum-weight cycle covers and their approximability. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Vladimir G. Deineko, Alexander Tiskin Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough? Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Yuichi Kaji On the number of minimum weight codewords of SFA-LDPC codes. Search on Bibsonomy ISIT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Thomas Erlebach, Matús Mihalák A (4 + epsilon)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs. Search on Bibsonomy WAOA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Franz Aurenhammer, Yinfeng Xu Optimal Triangulations. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Greedy triangulation, ?-skeleton, LMT-skeleton, Computational complexity, Delaunay triangulation, Minimum weight triangulation
1Kuang-Yao Lee, Shing-Tung Lin, Ting-Chi Wang Redundant via insertion with wire bending. Search on Bibsonomy ISPD The full citation details ... 2009 DBLP  DOI  BibTeX  RDF redundant via, wire bending, integer linear program
1Gaurav S. Kasbekar, Yigal Bejerano, Saswati Sarkar Lifetime and coverage guarantees through distributed coordinate-free sensor activation. Search on Bibsonomy MOBICOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF coordinate-free, wireless sensor networks, approximation algorithms, distributed algorithms, coverage, network lifetime
1Virginia Vassilevska, Ryan Williams Finding, minimizing, and counting weighted subgraphs. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF 3sum, cliques, paths, subgraph isomorphism, weighted graph
1Albert Gordo, Ernest Valveny A Rotation Invariant Page Layout Descriptor for Document Classification and Retrieval. Search on Bibsonomy ICDAR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Yousheng Yang, Claudio Semini, Nikolaos G. Tsagarakis, Emanuele Guglielmino, Darwin G. Caldwell Leg mechanisms for hydraulically actuated robots. Search on Bibsonomy IROS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Makoto Miwa, Tadashi Wadayama, Ichi Takumi A cutting-plane method based on redundant rows for improving fractional distance. Search on Bibsonomy IEEE Journal on Selected Areas in Communications The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Tai Chi Wang, Shih Yu Chang, Hsiao-Chun Wu Optimal energy-efficient pair-wise cooperative transmission scheme for wimax mesh networks. Search on Bibsonomy IEEE Journal on Selected Areas in Communications The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Charanjit S. Jutla, Anindya C. Patthak Provably Good Codes for Hash Function Design. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jing Lei, Roy D. Yates, Larry J. Greenstein, Hang Liu Mapping link SNRs of real-world wireless networks onto an indoor testbed. Search on Bibsonomy IEEE Transactions on Wireless Communications The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Christos Koukouvinos, Dimitris E. Simos Self-dual Codes over Small Prime Fields from Combinatorial Designs. Search on Bibsonomy CAI The full citation details ... 2009 DBLP  DOI  BibTeX  RDF construction, combinatorial designs, Self-dual codes
1Deying Li, Qinghua Zhu, Huiqiang Yang Fault-Tolerant Routing: k-Inconnected Many-to-One Routing in Wireless Networks. Search on Bibsonomy COCOA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF k-inconnected many-to-one routing, fault-tolerant, wireless networks, heuristics
1Franziska Berger, Peter Gritzmann, Sven de Vries Minimum Cycle Bases and Their Applications. Search on Bibsonomy Algorithmics of Large and Complex Networks The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Subhas Kumar Ghosh, Koushik Sinha On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs. Search on Bibsonomy FCT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip N. Klein Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. Search on Bibsonomy ICALP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Cristina Bazgan, Basile Couëtoux, Zsolt Tuza Covering a Graph with a Constrained Forest (Extended Abstract). Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1André Schumacher, Harri Haanpää Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning. Search on Bibsonomy SSS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jianxin Wang, Guohong Jiang A Fixed-Parameter Enumeration Algorithm for the Weighted FVS Problem. Search on Bibsonomy TAMC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Torben Hagerup An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees. Search on Bibsonomy WG The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 439 (100 per page; Change: )
Pages: [1][2][3][4][5][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.