|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 369 occurrences of 254 keywords
|
|
|
Results
Found 893 publication records. Showing 893 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
72 | Lap Chi Lau, Mohit Singh |
Additive approximation for bounded degree survivable network design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 759-768, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithms, steiner tree, bounded degree, iterative rounding, survivable network design |
65 | Yu Wang 0003, Xiang-Yang Li 0001 |
Localized construction of bounded degree and planar spanner for wireless ad hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DIALM-POMC ![In: Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, San Diego, CA, USA, September 19, 2003, pp. 59-68, 2003, ACM. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
wireless ad hoc networks, topology control, localized algorithm, spanner, planar, bounded degree |
59 | Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Kong Yung |
Degree Bounded Network Design with Metric Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 125-134, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
58 | Franz-Josef Brandenburg |
The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 4th International Conference, RTA-91, Como, Italy, April 10-12, 1991, Proceedings, pp. 312-322, 1991, Springer, 3-540-53904-2. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
boundary and confluent graph grammars, operator normal form, graph languages of bounded degree, graph grammars |
57 | Mohit Singh, Lap Chi Lau |
Approximating minimum bounded degree spanning trees to within one of optimal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 661-670, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
approximation algorithm, spanning trees, bounded degree, iterative rounding |
56 | Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz |
Resource Allocation in Bounded Degree Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 54(1), pp. 89-106, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Bounded degree trees, Scheduling, Approximation algorithms, Bandwidth allocation, Storage allocation |
52 | Paola Alimonti, Tiziana Calamoneri |
Improved Approximations of Independent Dominating Set in Bounded Degree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings, pp. 2-16, 1996, Springer, 3-540-62559-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Minimum Independent Dominating Set, Approximation Algorithms, Local Search, Greedy, Regular Graphs, Cubic Graphs, Bounded Degree Graphs |
50 | Roy Friedman, Alex Kogan |
Brief announcement: deterministic dominating set construction in networks with bounded degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, pp. 285-286, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
dominating sets, bounded degree graphs, distributed approximation algorithms |
50 | Yu Wang 0003, Xiang-Yang Li 0001 |
Localized Construction of Bounded Degree and Planar Spanner for Wireless Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mob. Networks Appl. ![In: Mob. Networks Appl. 11(2), pp. 161-175, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Wireless ad hoc networks, topology control, localized algorithm, spanner, planar, bounded degree |
50 | Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid |
Constructing Plane Spanners of Bounded Degree and Low Weight. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 42(3-4), pp. 249-264, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Low weight graphs, Computational geometry, Planar graphs, Spanners, Bounded degree graphs |
49 | Artur Czumaj, Christian Sohler |
On testable properties in bounded degree graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 494-501, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
48 | Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed |
Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings, pp. 137-152, 1998, Springer, 3-540-64590-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
46 | Prosenjit Bose, Vida Dujmovic, David R. Wood |
Induced Subgraphs of Bounded Degree and Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, pp. 175-186, 2005, Springer, 3-540-31000-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
46 | Stefan S. Dantchev, Florent R. Madelaine |
Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, First International Symposium on Computer Science in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings, pp. 159-170, 2006, Springer, 3-540-34166-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Constraint Satisfaction, Duality, Monadic Second Order Logic, Logic in Computer Science, Graph Homomorphism |
45 | Christos Kaklamanis, Danny Krizanc, Satish Rao |
Universal Emulations with Sublogarithmic Slowdown ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 341-350, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
arbitrary bounded degree networks, universal emulations, sublogarithmic slowdown, bounded degree networks, area-universal network, VLSI layout area, N-node network, sublogarithmic bounds, hypercube, butterfly |
42 | Tamás Király, Lap Chi Lau, Mohit Singh |
Degree Bounded Matroids and Submodular Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings, pp. 259-272, 2008, Springer, 978-3-540-68886-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
37 | Hussein M. Alnuweiri |
A New Class of Optimal Bounded-Degree VLSI Sorting Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 42(6), pp. 746-752, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
VLSI sorting networks, optimal VLSI sorters, rotate-sort, enumeration-sort, reduced-area, K-shuffle layouts, VLSI, optimisation, logic design, sorting, time complexity, bounded-degree |
37 | Frank Thomson Leighton, Bruce M. Maggs, Ramesh K. Sitaraman |
On the Fault Tolerance of Some Popular Bounded-Degree Networks ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 542-552, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
bounded-degree networks, worst-case faults, shuffle-exchange graph, constant-factor slowdown, routing packets, fault tolerance, parallel computation, hypercubic networks, binary trees, meshes of trees |
37 | Kieran T. Herley |
Efficient Simulations of Small Shared Memories on Bounded Degree Networks (Preliminary Version) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 390-395, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
small shared memories, bounded degree networks, PRAM algorithms, simulation, parallel random-access machine, PRAM |
37 | Sunil Arya, Michiel H. M. Smid |
Efficient Construction of a Bounded Degree Spanner with Low Weight. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '94, Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994, Proceedings, pp. 48-59, 1994, Springer, 3-540-58434-X. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
36 | Xiang-Yang Li 0001, Yu Wang 0003 |
Efficient Construction of Low Weight Bounded Degree Planar Spanner. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings, pp. 374-384, 2003, Springer, 3-540-40534-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
34 | Iyad A. Kanj, Ljubomir Perkovic |
Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALGOSENSORS ![In: Algorithmic Aspects of Wireless Sensor Networks, Second International Workshop, ALGOSENSORS 2006, Venice, Italy, July 15, 2006, Revised Selected Papers, pp. 95-106, 2006, Springer, 3-540-69085-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto |
The Travelling Salesman Problem in Bounded Degree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 198-209, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz |
Resource Allocation in Bounded Degree Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings, pp. 64-75, 2006, Springer, 3-540-38875-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Markus Lohrey |
Automatic Structures of Bounded Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003, Proceedings, pp. 346-360, 2003, Springer, 3-540-20101-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
33 | Oded Goldreich 0001, Dana Ron |
Property Testing in Bounded Degree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 32(2), pp. 302-343, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Randomized algorithms, Graph algorithms, Property testing |
33 | Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender |
A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, pp. 380-390, 2001, Springer, 3-540-42493-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
33 | Haim Kaplan, Ron Shamir |
Bounded Degree Interval Sandwich Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 24(2), pp. 96-104, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Parametrized complexity, Computational biology, Interval graphs, Design and analysis of algorithms |
32 | Sharon Marko, Dana Ron |
Approximating the distance to properties in bounded-degree and general sparse graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 5(2), pp. 22:1-22:28, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Sublinear approximation algorithms, property testing, graph properties, distance approximation |
32 | Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro |
Time Bound for Broadcasting in Bounded Degree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 15th International Workshop, WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings, pp. 19-33, 1989, Springer, 3-540-52292-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
32 | Itai Benjamini, Oded Schramm, Asaf Shapira |
Every minor-closed property of sparse graphs is testable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 393-402, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
minor closed properties, graph algorithms, property testing |
31 | Luca Trevisan |
Non-approximability results for optimization problems on bounded degree instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece, pp. 453-461, 2001, ACM, 1-58113-349-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
30 | Artur Czumaj, Christian Sohler |
Testing Expansion in Bounded-Degree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings, pp. 570-578, 2007, IEEE Computer Society, 978-0-7695-3010-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Osamu Maruyama, Satoru Miyano |
Graph Inference from a Walk for TRees of Bounded Degree 3 is NP-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995, Proceedings, pp. 257-266, 1995, Springer, 3-540-60246-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
29 | Uros Cibej, Aaron Li, István Miklós, Sohaib Nasir, Varun Srikanth |
Constructing bounded degree graphs with prescribed degree and neighbor degree sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 332, pp. 47-61, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
29 | Uros Cibej, Aaron Li, István Miklós, Sohaib Nasir, Varun Srikanth |
Constructing bounded degree graphs with prescribed degree and neighbor degree sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2109.12993, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
29 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg |
Nash equilibria in graphical games on trees revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), Ann Arbor, Michigan, USA, June 11-15, 2006, pp. 100-109, 2006, ACM, 1-59593-236-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
PPAD-completeness, nash equilibrium, graphical games |
29 | Miroslav Chlebík, Janka Chlebíková |
Approximation hardness of edge dominating set problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 11(3), pp. 279-290, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Minimum edge dominating set, Minimum maximal matching, Approximation lower bound, Everywhere dense graphs, Bounded degree graphs |
29 | Wai-Kei Mak, D. F. Wong 0001 |
Board-level multi-terminal net routing for FPGA-based logic emulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1995 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1995, San Jose, California, USA, November 5-9, 1995, pp. 339-344, 1995, IEEE Computer Society / ACM, 0-8186-7213-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
board-level routing, bounded-degree hypergraph-to-graph transformation, logic emulation systems, multi-terminal net decomposition net, FPGA |
28 | Stratis Ioannidis, Christos Nomikos, Aris Pagourtzis, Stathis Zachos |
Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Panhellenic Conference on Informatics ![In: Advances in Informatics, 10th Panhellenic Conference on Informatics, PCI 2005, Volos, Greece, November 11-13, 2005, Proceedings, pp. 57-67, 2005, Springer, 3-540-29673-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
routing and path coloring, optical networking, wavelength assignment, WDM networks |
28 | Jaroslav Nesetril, Patrice Ossona de Mendez |
Linear time low tree-width partitions and algorithmic consequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 391-400, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
bounded expansion, fraternal augmentation, coloration, first order logic, subgraph isomorphism, tree-width, graph minor |
28 | Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos |
Isomorphism for Graphs of Bounded Distance Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 24(2), pp. 105-127, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Distance pathwidth, Distance treewidth, Graph isomorphism, Fixed parameter tractability |
27 | Mohammad Khairul Hasan, Sung-Eui Yoon, Kyung-Yong Chwa |
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics, Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009. Proceedings, pp. 153-162, 2009, Springer, 978-3-642-02269-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
27 | Dietrich Kuske, Markus Lohrey |
Automatic Structures of Bounded Degree Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009. Proceedings, pp. 364-378, 2009, Springer, 978-3-642-04026-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
27 | Vadim V. Lozin, Martin Milanic |
Tree-Width and Optimization in Bounded Degree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers, pp. 45-54, 2007, Springer, 978-3-540-74838-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Hereditary class of graphs, Induced Matching, Dominating set, Tree-width |
27 | Andrej Bogdanov, Kenji Obata, Luca Trevisan |
A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings, pp. 93-102, 2002, IEEE Computer Society, 0-7695-1822-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
27 | Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid |
Constructing Plane Spanners of Bounded Degree and Low Weight. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings, pp. 234-246, 2002, Springer, 3-540-44180-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
27 | Douglas Comer |
Extracting unique rows of a bounded degree array using tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AFIPS National Computer Conference ![In: American Federation of Information Processing Societies: 1980 National Computer Conference, 19-22 May 1980, Anaheim, California, USA, pp. 807-809, 1980, AFIPS Press, 978-1-4503-7923-6. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
27 | Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos |
Isomorphism for Graphs of Bounded Distance Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, Third Italian Conference, CIAC '97, Rome, Italy, March 12-14, 1997, Proceedings, pp. 276-287, 1997, Springer, 3-540-62592-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
27 | Iyad A. Kanj, Ljubomir Perkovic, Ge Xia |
Computing Lightweight Spanners Locally. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008. Proceedings, pp. 365-378, 2008, Springer, 978-3-540-87778-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Peter Damaschke |
Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers, pp. 98-109, 2009, Springer, 978-3-642-11268-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
26 | Satyen Kale, C. Seshadhri 0001 |
An Expansion Tester for Bounded Degree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 527-538, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Sharon Marko, Dana Ron |
Distance Approximation in Bounded-Degree and General Sparse Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings, pp. 475-486, 2006, Springer, 3-540-38044-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Oded Goldreich 0001, Dana Ron |
A Sublinear Bipartiteness Tester for Bounded Degree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 19(3), pp. 335-373, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 68Q25, 68R10 |
24 | Mohammad Taghi Hajiaghayi, Naomi Nishimura |
Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings, pp. 305-318, 2002, Springer, 3-540-44040-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Xavier Muñoz, Ignasi Sau |
Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers, pp. 300-311, 2008, 978-3-540-92247-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
SONET over WDM, bridgeless graph, optical networks, graph decomposition, traffic grooming, ADM, cubic graph |
24 | Michael R. Capalbo |
Explicit Bounded-Degree Unique-Neighbor Concentrators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 25(4), pp. 379-391, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C35 |
24 | Therese C. Biedl, Dana F. Wilkinson |
Bounded-Degree Independent Sets in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 38(3), pp. 253-278, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Timothy M. Chan |
Euclidean Bounded-Degree Spanning Tree Ratios. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 32(2), pp. 177-194, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Timothy M. Chan |
Euclidean bounded-degree spanning tree ratios. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 19th ACM Symposium on Computational Geometry, San Diego, CA, USA, June 8-10, 2003, pp. 11-19, 2003, ACM, 1-58113-663-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
approximation, minimum spanning trees, discrete geometry |
24 | Therese C. Biedl, Dana F. Wilkinson |
Bounded-Degree Independent Sets in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings, pp. 416-427, 2002, Springer, 3-540-00142-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Marek Karpinski |
Approximating Bounded Degree Instances of NP-Hard Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings, pp. 24-34, 2001, Springer, 3-540-42487-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Andrea Francke, Michael Hoffmann 0001 |
The Euclidean degree-4 minimum spanning tree problem is NP-hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 179-188, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
degree-constricted graphs, degree-restricted graphs, np-complete, reduction, spanning trees, geometric optimization, geometric graphs, bounded-degree graphs |
23 | Juan A. Garay, Rafail Ostrovsky |
Almost-Everywhere Secure Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT 2008, 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey, April 13-17, 2008. Proceedings, pp. 307-323, 2008, Springer, 978-3-540-78966-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
secure message transmission, almost-everywhere agreement, bounded-degree networks, Secure multi-party computation, expander graphs |
23 | Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh |
Survivable network design with degree or order constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 651-660, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
approximation algorithms, network design, NP-hard problems, bounded degree, iterative rounding |
23 | Wen-Zhan Song 0001, Yu Wang 0003, Xiang-Yang Li 0001, Ophir Frieder |
Localized Algorithms for Energy Efficient Topology in Wireless Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mob. Networks Appl. ![In: Mob. Networks Appl. 10(6), pp. 911-923, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
efficient localized algorithm, wireless ad hoc networks, topology control, spanner, planar, bounded degree, power assignment |
23 | Michael Hoffmann 0001, Csaba D. Tóth |
Pointed and colored binary encompassing trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 81-90, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
spanning tree, line segments, bounded degree, pseudo-triangulation |
23 | Wen-Zhan Song 0001, Yu Wang 0003, Xiang-Yang Li 0001 |
Localized algorithms for energy efficient topology in wireless ad hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiHoc ![In: Proceedings of the 5th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2004, Roppongi Hills, Tokyo, Japan, May 24-26, 2004, pp. 98-108, 2004, ACM, 1-58113-849-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
wireless ad hoc networks, topology control, spanner, planar, bounded degree |
23 | Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio |
On the Applications of Multiplicity Automata in Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 349-358, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
multiplicity automata, DNF formulae learnability, minimal multiplicity automaton, multiplicity automata learning, finite field polynomials, infinite field bounded-degree polynomials, decision trees, states, matrix, automata theory, automata theory, query complexity |
23 | Daniel A. Spielman, Shang-Hua Teng |
Spectral Partitioning Works: Planar Graphs and Finite Element Meshes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 96-105, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
bounded-degree planar graphs, planar graphs, finite element analysis, numerical algorithms, spectral partitioning, finite element meshes |
23 | Nader H. Bshouty, Yishay Mansour |
Simple Learning Algorithms for Decision Trees and Multivariate Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 304-311, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
constant bounded product distribution, /spl epsiv/-approximation, j-disjoint DNF, bounded term size, learning (artificial intelligence), decision trees, interpolation, interpolation, finite fields, polynomials, decision theory, learning algorithms, learnability, multivariate polynomials, membership queries, bounded degree |
23 | Edwin Hsing-Mean Sha, Kenneth Steiglitz |
Reconfigurability and Reliability of Systolic/Wavefront Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 42(7), pp. 854-862, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
wavefront arrays, fault-tolerant redundant structures, reliable arrays, application graph, finitely reconfigurable, locally reconfigurable, reliability, lower bound, fault tolerant computing, reconfigurability, time complexity, systolic arrays, systolic arrays, reconfigurable architectures, dynamic graphs, bounded-degree graphs |
22 | Sriram Sankaranarayanan 0001 |
Automatic invariant generation for hybrid systems using ideal fixed points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Proceedings of the 13th ACM International Conference on Hybrid Systems: Computation and Control, HSCC 2010, Stockholm, Sweden, April 12-15, 2010, pp. 221-230, 2010, ACM, 978-1-60558-955-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
verification, hybrid systems, invariants, conservation laws, algebraic geometry |
22 | Michael Colón |
Approximating the Algebraic Relational Semantics of Imperative Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAS ![In: Static Analysis, 11th International Symposium, SAS 2004, Verona, Italy, August 26-28, 2004, Proceedings, pp. 296-311, 2004, Springer, 3-540-22791-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
22 | Oded Goldreich 0001, Laliv Tauber |
Testing in the bounded-degree graph model with degree bound two. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR22, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
22 | Christian Joseph Altomare |
A semigroup proof of the bounded degree case of S.B. Raoʼs Conjecture on degree sequences and a bipartite analogue. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 102(3), pp. 756-759, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
22 | Claus Diem |
An Index Calculus Algorithm for Plane Curves of Small Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANTS ![In: Algorithmic Number Theory, 7th International Symposium, ANTS-VII, Berlin, Germany, July 23-28, 2006, Proceedings, pp. 543-557, 2006, Springer, 3-540-36075-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura |
Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Found. Comput. Sci. ![In: Int. J. Found. Comput. Sci. 31(2), pp. 253-273, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
22 | Vida Dujmovic, Pat Morin, David R. Wood |
Queue Layouts of Graphs with Bounded Degree and Bounded Genus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1901.05594, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
22 | Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt |
Planar Graphs of Bounded Degree Have Bounded Queue Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 48(5), pp. 1487-1502, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Alessio Conte, Mamadou Moustapha Kanté, Andrea Marino 0001, Takeaki Uno |
Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings, pp. 148-159, 2019, Springer, 978-3-030-25004-1. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Benoît Darties, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet |
The Balanced Connected Subgraph Problem: Complexity Results in Bounded-Degree and Bounded-Diameter Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications - 13th International Conference, COCOA 2019, Xiamen, China, December 13-15, 2019, Proceedings, pp. 449-460, 2019, Springer, 978-3-030-36411-3. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt |
Planar graphs of bounded degree have bounded queue number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019., pp. 176-184, 2019, ACM, 978-1-4503-6705-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Steven Chaplick, Jirí Fiala 0001, Pim van 't Hof, Daniël Paulusma, Marek Tesar 0001 |
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 590, pp. 86-95, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
22 | Steven Chaplick, Jirí Fiala 0001, Pim van 't Hof, Daniël Paulusma, Marek Tesar 0001 |
Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1408.6676, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
22 | Kord Eickmeyer, Ken-ichi Kawarabayashi |
Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGT ![In: Algorithmic Game Theory - 6th International Symposium, SAGT 2013, Aachen, Germany, October 21-23, 2013. Proceedings, pp. 134-145, 2013, Springer, 978-3-642-41391-9. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
22 | Steven Chaplick, Jirí Fiala 0001, Pim van 't Hof, Daniël Paulusma, Marek Tesar 0001 |
Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013. Proceedings, pp. 121-132, 2013, Springer, 978-3-642-40163-3. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
22 | Albert Atserias |
The Proof-Search Problem between Bounded-Width Resolution and Bounded-Degree Semi-algebraic Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings, pp. 1-17, 2013, Springer, 978-3-642-39070-8. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
22 | Satyajit Banerjee, Atish Datta Chowdhury, Subhas Kumar Ghosh |
Distributed approximation for maximum weight matching on bounded degree bounded integer weight graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 109(14), pp. 790-794, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
22 | Prosenjit Bose, Vida Dujmovic, David R. Wood |
Induced Subgraphs of Bounded Degree and Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Contributions Discret. Math. ![In: Contributions Discret. Math. 1(1), 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
|
22 | Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed |
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 48(2), pp. 333-359, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
22 | Gruia Calinescu, Cristina G. Fernandes |
Multicuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 7, pp. 194-197, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | Ganeshkumar Ganapathysaravanabavan, Tandy J. Warnow |
Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, First International Workshop, WABI 2001, Aarhus, Denmark, August 28-31, 2001, Proceedings, pp. 156-163, 2001, Springer, 3-540-42516-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | Edward R. Scheinerman, Ann N. Trenk |
On Generalized Perfect Graphs: Bounded Degree and Bounded Edge Perfection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 44(1-3), pp. 233-245, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
21 | Martin Fürer, Shiva Prasad Kasiviswanathan |
Approximately Counting Embeddings into Random Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings, pp. 416-429, 2008, Springer, 978-3-540-85362-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Arist Kojevnikov, Alexander S. Kulikov |
Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings, pp. 11-21, 2006, Springer, 3-540-37206-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Michael Dom, Jiong Guo, Rolf Niedermeier |
Bounded Degree Closest k-Tree Power Is NP-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings, pp. 757-766, 2005, Springer, 3-540-28061-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Michal Malafiejski, Krzysztof Giaro, Robert Janczewski, Marek Kubale |
Sum Coloring of Bipartite Graphs with Bounded Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 40(4), pp. 235-244, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Sum coloring, Chromatic sum, Bipartite graphs |
21 | Andreas Goerdt |
The Cutting Plane Proof System with Bounded Degree of Falsity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 5th Workshop, CSL '91, Berne, Switzerland, October 7-11, 1991, Proceedings, pp. 119-133, 1991, Springer, 3-540-55789-X. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
20 | Arnaud Carayol, Antoine Meyer |
Linearly bounded infinite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 43(4), pp. 265-292, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 893 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ >>] |
|