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