|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1651 occurrences of 861 keywords
|
|
|
Results
Found 5849 publication records. Showing 5849 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
36 | Partha Dutta, Sharad Jaiswal, Debmalya Panigrahi, Rajeev Rastogi |
A New Channel Assignment Mechanism for Rural Wireless Mesh Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOCOM ![In: INFOCOM 2008. 27th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 13-18 April 2008, Phoenix, AZ, USA, pp. 2261-2269, 2008, IEEE, 978-1-4244-2026-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Shuji Isobe, Xiao Zhou 0001, Takao Nishizeki |
Total Colorings Of Degenerate Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 27(2), pp. 167-182, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C15, 05C85, 90C39 |
36 | Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch |
Exact Algorithms for Graph Homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 41(2), pp. 381-393, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky |
Online Conflict-Free Colorings for Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, pp. 219-230, 2007, Springer, 978-3-540-73419-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Haytham Elghazel, Véronique Deslandres, Mohand-Said Hacid, Alain Dussauchoy, Hamamache Kheddouci |
A New Clustering Approach for Symbolic Data and Its Validation: Application to the Healthcare Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Foundations of Intelligent Systems, 16th International Symposium, ISMIS 2006, Bari, Italy, September 27-29, 2006, Proceedings, pp. 473-482, 2006, Springer, 3-540-45764-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Khaled M. Elbassioni, Nabil H. Mustafa |
Conflict-Free Colorings of Rectangles Ranges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings, pp. 254-263, 2006, Springer, 978-3-540-32301-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Martin Marciniszyn, Jozef Skokan, Reto Spöhel, Angelika Steger |
Threshold Functions for Asymmetric Ramsey Properties Involving Cliques. ![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. 462-474, 2006, Springer, 3-540-38044-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Gruia Calinescu, Michael J. Pelsmajer |
Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings, pp. 117-128, 2006, Springer, 3-540-49994-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch |
Exact Algorithms for Graph Homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings, pp. 161-171, 2005, Springer, 3-540-28193-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Takehiro Ito, Akira Kato, Xiao Zhou 0001, Takao Nishizeki |
Algorithms for Finding Distance-Edge-Colorings of Graphs. ![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. 798-807, 2005, Springer, 3-540-28061-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Shuji Isobe, Xiao Zhou 0001, Takao Nishizeki |
Total Colorings of Degenerated Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 506-517, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
36 | Spyridoula M. Armeni, Dimitris Christodoulakis, Ioannis Kostopoulos, Polychronis D. Kountrias, Yannis C. Stamatiou, Michalis Nik Xenos |
An Information Hiding Method Based on Computational Intractable Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Panhellenic Conference on Informatics ![In: Advances in Informatics, 8th Panhellenic Conference on Informatics, PCI 2001. Nicosia, Cyprus, November 8-10, 2001, Revised Selected Papers, pp. 262-278, 2001, Springer, 3-540-07544-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
36 | Xiao Zhou 0001, K. Fuse, Takao Nishizeki |
A Linear Algorithm for Finding [{g, f}]-Colorings of Partial {k}-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 27(3), pp. 227-243, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
36 | Antonio Lain, Prithviraj Banerjee |
Techniques to overlap computation and communication in irregular iterative applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Supercomputing ![In: Proceedings of the 8th international conference on Supercomputing, ICS 1994, Manchester, UK, July 11-15, 1994, pp. 236-245, 1994, ACM, 0-89791-665-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
34 | Hal A. Kierstead, Daqing Yang |
Orderings on Graphs and Game Coloring Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 20(3), pp. 255-264, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
k-coloring number, k-game coloring number, planar graphs |
34 | Yuval Rabani |
Path Coloring on the Mesh. ![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. 400-409, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
minimum path coloring problem, circuit routing, mesh, vertices, packet routing, graph colouring, randomized rounding, all-optical networks, path coloring |
34 | C. R. Subramanian 0001 |
Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 463-472, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
minimum coloring random graphs, semi-random graphs, polynomial expected time, k-coloring, worst-case model, computational complexity, graph theory, vertices, graph colouring |
34 | Robert G. Herriot |
Algorithm 364: coloring polygonal regions [Z]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 12(12), pp. 685-686, 1969. The full citation details ...](Pics/full.jpeg) |
1969 |
DBLP DOI BibTeX RDF |
coloring planar surfaces, coloring polygonal regions, drawing pictures, shading enclosed regions |
34 | Daniel Král, Pavel Nejedlý |
Group Coloring and List Group Coloring Are Pi2P-Complete (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings, pp. 274-286, 2004, Springer, 3-540-22823-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Johannes Schneider 0002, Roger Wattenhofer |
A new technique for distributed symmetry breaking. ![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. 257-266, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
parallel algorithms, coloring, local algorithms, symmetry breaking, network decomposition |
33 | Haiying Wang |
On the adjacent vertex-distinguishing total chromatic numbers of the graphs with Delta (G) = 3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 14(1), pp. 87-109, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
The adjacent vertex-distinguishing total coloring, The adjacent vertex-distinguishing total chromatic number, Subdivision vertex, Subdivision graph |
33 | John Kalamatianos, Alireza Khalafi, David R. Kaeli, Waleed Meleis |
Analysis of Temporal-Based Program Behavior for Improved Instruction Cache Performance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 48(2), pp. 168-175, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
program reordering, graph pruning, graph coloring, Instruction caches, temporal locality, conflict misses |
33 | Abhik Roychoudhury, Susmita Sur-Kolay |
Efficient Algorithms for Vertex Arboricity of Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 15th Conference, Bangalore, India, December 18-20, 1995, Proceedings, pp. 37-51, 1995, Springer, 3-540-60692-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Vertex arboricity, testing of sequential circuits, graph coloring, planar graph |
31 | Jianfeng Hou, Guizhen Liu, Jianliang Wu |
Some Results on List Total Colorings of Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (3) ![In: Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27 - 30, 2007, Proceedings, Part III, pp. 320-328, 2007, Springer, 978-3-540-72587-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
total coloring, list total coloring, planar graph, cycle |
31 | Ken-ichi Kawarabayashi, Bojan Mohar |
Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs. ![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. 401-416, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Hadwiger conjecture, odd-minor, graph coloring, graph minor, list coloring |
31 | Kelun Wang, Hongxiang Ren, Shuang Wang |
Study on Art Gallery Based on 4-coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CGIV ![In: Sixth International Conference on Computer Graphics, Imaging and Visualization: New Advances and Trends, CGIV 2009, 11-14 August 2009, Tianjin, China, pp. 255-258, 2009, IEEE Computer Society, 978-0-7695-3789-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
31 | Zdenek Dvorák 0001, Ken-ichi Kawarabayashi, Robin Thomas 0001 |
Three-coloring triangle-free planar graphs in linear time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 1176-1182, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
31 | Jirí Fiala 0001, Petr A. Golovach, Jan Kratochvíl |
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings, pp. 221-230, 2009, Springer, 978-3-642-02016-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
31 | Wenjun Xiao, Wenhong Wei, Weidong Chen 0009, Mingxin He, Behrooz Parhami |
Comments on "Low Diameter Interconnections for Routing in High-Performance Parallel Systems, " with Connections and Extensions to Arc Coloring of Coset Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 57(12), pp. 1726-1728, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Mingen Lin, Zhiyong Lin, Jinhui Xu 0001 |
Almost optimal solutions for bin coloring problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 16(1), pp. 16-27, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Online algorithms, Bin packing |
31 | Marco Chiarandini, Irina Dumitrescu, Thomas Stützle |
Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Hybrid Metaheuristics ![In: Hybrid Metaheuristics, An Emerging Approach to Optimization, pp. 117-150, 2008, Springer, 978-3-540-78294-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Jurek Czyzowicz, Stefan Dobrev, Hernán González-Aguilar, Rastislav Kralovic, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia |
Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings, pp. 170-181, 2008, Springer, 978-3-540-79227-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Ernst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, Julián Mestre |
Approximating the Interval Constrained Coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings, pp. 210-221, 2008, Springer, 978-3-540-69900-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Liu Wenyin, Anthony Y. Fu, Xiaotie Deng |
Exposing Homograph Obfuscation Intentions by Coloring Unicode Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APWeb ![In: Progress in WWW Research and Development, 10th Asia-Pacific Web Conference, APWeb 2008, Shenyang, China, April 26-28, 2008. Proceedings, pp. 275-286, 2008, Springer, 978-3-540-78848-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Wangsen Feng, Li'ang Zhang, Wanling Qu, Hanpin Wang |
Approximation Algorithms for Maximum Edge Coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings, pp. 646-658, 2007, Springer, 978-3-540-72503-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
31 | Takao Ono, Mutsunori Yagiura, Tomio Hirata |
A Vector Assignment Approach for the Graph Coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LION ![In: Learning and Intelligent Optimization, Second International Conference, LION 2007, Trento, Italy, December 8-12, 2007. Selected Papers, pp. 167-176, 2007, Springer, 978-3-540-92694-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
31 | Vishal Doshi, Devavrat Shah, Muriel Médard, Sidharth Jaggi |
Distributed Functional Compression through Graph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCC ![In: 2007 Data Compression Conference (DCC 2007), 27-29 March 2007, Snowbird, UT, USA, pp. 93-102, 2007, IEEE Computer Society, 978-0-7695-2791-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
31 | Keith D. Cooper, Anshuman Dasgupta |
Tailoring Graph-coloring Register Allocation For Runtime Compilation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CGO ![In: Fourth IEEE/ACM International Symposium on Code Generation and Optimization (CGO 2006), 26-29 March 2006, New York, New York, USA, pp. 39-49, 2006, IEEE Computer Society, 0-7695-2499-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Leah Epstein, Asaf Levin, Gerhard J. Woeginger |
Graph Coloring with Rejection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings, pp. 364-375, 2006, Springer, 3-540-38875-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Adrian Kosowski, Lukasz Kuszner |
On Greedy Graph Coloring in the Distributed Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28 - September 1, 2006, Proceedings, pp. 592-601, 2006, Springer, 3-540-37783-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Hagit Attiya, Eshcar Hillel |
Built-In Coloring for Highly-Concurrent Doubly-Linked Lists. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings, pp. 31-45, 2006, Springer, 3-540-44624-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Yasuhiko Takenaga, Kenichi Higashide |
Vertex Coloring of Comparability+ke and -ke Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers, pp. 102-112, 2006, Springer, 3-540-48381-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Irit Dinur, Oded Regev 0001, Clifford D. Smyth |
The Hardness of 3-Uniform Hypergraph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 25(5), pp. 519-535, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 68Q17 |
31 | Mingen Lin, Zhiyong Lin, Jinhui Xu 0001 |
Almost Optimal Solutions for Bin Coloring Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 82-91, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
31 | Doruk Bozdag, Ümit V. Çatalyürek, Assefaw Hadish Gebremedhin, Fredrik Manne, Erik G. Boman, Füsun Özgüner |
A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPCC ![In: High Performance Computing and Communications, First International Conference, HPCC 2005, Sorrento, Italy, September 21-23, 2005, Proceedings, pp. 796-806, 2005, Springer, 3-540-29031-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
31 | Shenshen Gu |
An Improved Transiently Chaotic Neural Network for Solving the K-Coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (1) ![In: Advances in Neural Networks - ISNN 2005, Second International Symposium on Neural Networks, Chongqing, China, May 30 - June 1, 2005, Proceedings, Part I, pp. 750-755, 2005, Springer, 3-540-25912-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
31 | Thomas Bietenhader, Yoshio Okamoto |
Core Stability of Minimum Coloring Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers, pp. 389-401, 2004, Springer, 3-540-24132-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Ünal Ufuktepe, Goksen Bacak, Tina Beseri |
Graph Coloring with web Mathematica. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science ![In: Computational Science - ICCS 2004, 4th International Conference, Kraków, Poland, June 6-9, 2004, Proceedings, Part IV, pp. 376-381, 2004, Springer, 3-540-22129-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Noga Alon, Vera Asodi |
Edge Coloring with Delays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings, pp. 237-248, 2004, Springer, 3-540-22894-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Srinivasan Parthasarathy 0002, Rajiv Gandhi |
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings, pp. 447-459, 2004, Springer, 3-540-24058-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Vangelis Th. Paschos |
Polynomial Approximation and Graph-Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 70(1), pp. 41-86, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
AMS Subject Classification: 05C15, 68Q17, 68Q25, 90C59, 68W25 |
31 | Mansoor Alicherry, Randeep Bhatia |
Line System Design and a Generalized Coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings, pp. 19-30, 2003, Springer, 3-540-20064-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
31 | Johan Runeson, Sven-Olof Nyström |
Retargetable Graph-Coloring Register Allocation for Irregular Architectures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCOPES ![In: Software and Compilers for Embedded Systems, 7th International Workshop, SCOPES 2003, Vienna, Austria, September 24-26, 2003, Proceedings, pp. 240-254, 2003, Springer, 3-540-20145-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
31 | Cécile Murat, Vangelis Th. Paschos |
The Probabilistic Minimum Coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers, pp. 346-357, 2003, Springer, 3-540-20452-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
31 | Ioan Todinca |
Coloring Powers of Graphs of Bounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers, pp. 370-382, 2003, Springer, 3-540-20452-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
31 | Udo Adamy, Thomas Erlebach |
Online Coloring of Intervals with Bandwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers, pp. 1-12, 2003, Springer, 3-540-21079-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
31 | József Beck, Sachin Lodha |
Efficient proper 2-coloring of almost disjoint hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 598-605, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
31 | Nitin Ahuja, Anand Srivastav |
On Constrained Hypergraph Coloring and Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings, pp. 14-25, 2002, Springer, 3-540-44186-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
31 | Harold N. Gabow, San Skulrattanakulchai |
Coloring Algorithms on Subcubic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings, pp. 67-76, 2002, Springer, 3-540-43996-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
31 | Martin Charles Golumbic, Assaf Siani |
Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AISC ![In: Artificial Intelligence, Automated Reasoning, and Symbolic Computation, Joint International Conferences, AISC 2002 and Calculemus 2002, Marseille, France, July 1-5, 2002, Proceedings, pp. 196-207, 2002, Springer, 3-540-43865-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
31 | Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano |
Approximate Constrained Bipartite Edge Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings, pp. 21-31, 2001, Springer, 3-540-42707-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
31 | Xiao Zhou 0001, Takao Nishizeki |
Algorithm for the Cost Edge-Coloring of Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings, pp. 288-297, 2001, Springer, 3-540-42494-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
31 | Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen |
lambda-Coloring of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings, pp. 395-406, 2000, Springer, 3-540-67141-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
31 | Olivier Coudert |
Exact Coloring of Real-Life Graphs is Easy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 34st Conference on Design Automation, Anaheim, California, USA, Anaheim Convention Center, June 9-13, 1997., pp. 121-126, 1997, ACM Press, 0-89791-920-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
31 | Hui Chen, Alan M. Frieze |
Coloring Bipartite Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings, pp. 345-358, 1996, Springer, 3-540-61310-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
31 | C. R. Subramanian 0001 |
Improved Algorithms for Coloring Random Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings, pp. 460-468, 1994, Springer, 3-540-58325-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
31 | C. R. Subramanian 0001, C. E. Veni Madhavan |
Coloring Semi-Random Graphs in Polynomial Expected Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 14th Conference, Madras, India, December 15-17, 1994, Proceedings, pp. 137-148, 1994, Springer, 3-540-58715-2. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
31 | Magnús M. Halldórsson |
Parallel and On-line Graph Coloring Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings, pp. 61-70, 1992, Springer, 3-540-56279-6. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
31 | Fred C. Chow, John L. Hennessy |
Register allocation by priority-based coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGPLAN Symposium on Compiler Construction ![In: Proceedings of the 1984 SIGPLAN Symposium on Compiler Construction, Montreal, Canada, June 17-22, 1984, pp. 222-232, 1984, ACM, 0-89791-139-3. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
31 | Fred C. Chow, John L. Hennessy |
Register allocation by priority-based coloring (with retrospective) ![Search on Bibsonomy](Pics/bibsonomy.png) |
Best of PLDI ![In: 20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation 1979-1999, A Selection, pp. 91-103, 1984, ACM, 1-58113-623-4. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
31 | M. R. Garey, David S. Johnson |
The Complexity of Near-Optimal Graph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 23(1), pp. 43-49, 1976. The full citation details ...](Pics/full.jpeg) |
1976 |
DBLP DOI BibTeX RDF |
|
29 | Flavia Bonomo, Mariano Cecowski Palacio |
Between coloring and list-coloring: μ-coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 99, pp. 383-398, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
29 | Flavia Bonomo, Mariano Cecowski Palacio |
Between coloring and list-coloring: mu-coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 19, pp. 117-123, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc |
Distributed computing with advice: information sensitivity of graph coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 21(6), pp. 395-403, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Distributed computing, Graph coloring, Network algorithm |
29 | Leah Epstein, Thomas Erlebach, Asaf Levin |
Variable Sized Online Interval Coloring with Bandwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 53(3), pp. 385-401, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Interval coloring, Approximation algorithm, Lower bound, Competitive analysis |
29 | Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky |
Coloring Geometric Range Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 41(2), pp. 348-362, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Geometric hypergraphs, Decompositions, Coloring, Covering |
29 | Tobias Bandh, Georg Carle, Henning Sanneck |
Graph coloring based physical-cell-ID assignment for LTE networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCMC ![In: Proceedings of the International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly, IWCMC 2009, Leipzig, Germany, June 21-24, 2009, pp. 116-120, 2009, ACM, 978-1-60558-569-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
physical cell ID, management, graph coloring, LTE |
29 | Haytham Elghazel, Khalid Benabdeslem |
Towards B-Coloring of SOM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MLDM ![In: Machine Learning and Data Mining in Pattern Recognition, 6th International Conference, MLDM 2009, Leipzig, Germany, July 23-25, 2009. Proceedings, pp. 322-336, 2009, Springer, 978-3-642-03069-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
graph b-coloring, topological organization, clustering, Self-organizing map |
29 | N. S. Narayanaswamy, R. Subhash Babu |
A Note on First-Fit Coloring of Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 25(1), pp. 49-53, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
First fit for online graph coloring, Column construction method, Competitive analysis |
29 | Noureddine Bouhmala, Ole-Christoffer Granmo |
Solving Graph Coloring Problems Using Learning Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoCOP ![In: Evolutionary Computation in Combinatorial Optimization, 8th European Conference, EvoCOP 2008, Naples, Italy, March 26-28, 2008. Proceedings, pp. 277-288, 2008, Springer, 978-3-540-78603-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Combinatorial optimization, SAT, Learning automata, Graph coloring problem |
29 | Bernard Gendron, Alain Hertz, Patrick St-Louis |
On edge orienting methods for graph coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 13(2), pp. 163-178, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Edge orienting, Local search, Graph coloring |
29 | Pawel Terlecki, Krzysztof Walczak 0002 |
Jumping Emerging Pattern Induction by Means of Graph Coloring and Local Reducts in Transaction Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSFDGrC ![In: Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, 11th International Conference, RSFDGrC 2007, Toronto, Canada, May 14-16, 2007, Proceedings, pp. 363-370, 2007, Springer, 978-3-540-72529-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
jumping emerging pattern, pattern with negation, condensed decision table, rough set, graph coloring, transaction database, local reduct |
29 | Szymon Lukasik, Zbigniew Kokosinski, Grzegorz Swieton |
Parallel Simulated Annealing Algorithm for Graph Coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPAM ![In: Parallel Processing and Applied Mathematics, 7th International Conference, PPAM 2007, Gdansk, Poland, September 9-12, 2007, Revised Selected Papers, pp. 229-238, 2007, Springer, 978-3-540-68105-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
graph coloring, parallel simulated annealing, parallel metaheuristic |
29 | Thomas P. Hayes, Juan Carlos Vera 0001, Eric Vigoda |
Randomly coloring planar graphs with fewer colors than the maximum degree. ![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. 450-458, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Markov chain Monte Carlo (MCMC), graph coloring, planar graphs, coupling |
29 | Deepak Ajwani, Khaled M. Elbassioni, Sathish Govindarajan, Saurabh Ray |
Conflict-free coloring for rectangle ranges using O(n.382) colors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007, pp. 181-187, 2007, ACM, 978-1-59593-667-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
axis-parallel rectangles, conflict-free coloring, frequency assignment in wireless networks, monotone sequences, dominating sets |
29 | Djamel Gaceb, Véronique Eglin, Frank Lebourgeois, Hubert Emptoz |
A New Pyramidal Approach for the Address Block Location Based on Hierarchical Graph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIAR ![In: Image Analysis and Recognition, 4th International Conference, ICIAR 2007, Montreal, Canada, August 22-24, 2007, Proceedings, pp. 1276-1288, 2007, Springer, 978-3-540-74258-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Text localization, physical segmentation, business documents processing, Graph coloring, real time processing |
29 | Adam H. Berliner, Ulrike Bostelmann, Richard A. Brualdi, Louis Deaett |
Sum List Coloring Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 22(2), pp. 173-183, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Choosable function, Sum choice number, Sum choice greedy graph, Graph, List coloring |
29 | Irit Dinur, Elchanan Mossel, Oded Regev 0001 |
Conditional hardness for approximate coloring. ![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. 344-353, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
graph coloring, hardness of approximation, unique games conjecture |
29 | Zhi-Zhong Chen, Mitsuharu Kouno |
A Linear-Time Algorithm for 7-Coloring 1-Plane Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 43(3), pp. 147-177, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Plane embeddings, Plane embeddings, NP-completeness, Graph algorithms, Planar graphs, Planar graphs, Vertex coloring |
29 | Jon Lee 0001, Janny Leung, Sven de Vries |
Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 9(1), pp. 59-67, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
odd cycle, integer program, separation, edge coloring, binary encoding |
29 | Klaus Jansen, Lorant Porkolab |
Preemptive Scheduling with Dedicated Processors: Applications of Fractional Graph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 7(1), pp. 35-48, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
fractional graph coloring, scheduling, dedicated processors |
29 | Valmir Carneiro Barbosa, Carlos A. G. Assis, Josina O. do Nascimento |
Two Novel Evolutionary Formulations of the Graph Coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 8(1), pp. 41-63, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
genetic algorithms, evolutionary algorithms, genetic programming, graph coloring |
29 | Andrea Di Blas, Arun Jagota, Richard Hughey |
A Range-Compaction Heuristic for Graph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 9(6), pp. 489-506, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
iterative-greedy algorithm, DIMACS benchmarks, graph coloring |
29 | Thomas P. Hayes |
Randomly coloring graphs of girth at least five. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 269-278, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Glauber dynamics, concentration inequalities, posterior analysis, graph coloring, Markov chain Monte Carlo, Chernoff bounds |
29 | José Luis González Velarde, Manuel Laguna |
Tabu Search with Simple Ejection Chains for Coloring Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 117(1-4), pp. 165-174, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
ejection chains, tabu search, graph coloring, metaheuristics |
29 | David Eppstein, Marshall W. Bern, Brad L. Hutchings |
Algorithms for Coloring Quadtrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 32(1), pp. 87-94, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Four-color theorem, Graph coloring, Quadtree |
29 | Jeonghun Cho, Yunheung Paek, David B. Whalley |
Efficient register and memory assignment for non-orthogonal architectures via graph coloring and MST algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCTES-SCOPES ![In: Proceedings of the 2002 Joint Conference on Languages, Compilers, and Tools for Embedded Systems & Software and Compilers for Embedded Systems (LCTES'02-SCOPES'02), Berlin, Germany, 19-21 June 2002, pp. 130-138, 2002, ACM, 1-58113-527-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
dual memory, memory assignment, non-orthogonal architecture, compiler, graph coloring, maximum spanning tree |
29 | Vangelis Th. Paschos |
On-line independent set by coloring vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. ![In: Oper. Res. 1(3), pp. 213-224, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
On-line computation, Approximation algorithm, Coloring, Independent set |
29 | Sara Nicoloso, Majid Sarrafzadeh, X. Song |
On the Sum Coloring Problem on Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 23(2), pp. 109-126, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Over-the-cell routing, Approximation algorithms, Coloring, VLSI-design, Interval graphs |
29 | Daniela Genius |
Handling Cross Interferences by Cyclic Cache Line Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE PACT ![In: Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques, Paris, France, October 12-18, 1998, pp. 112-117, 1998, IEEE Computer Society, 0-8186-8591-3. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
cyclic graph coloring, meeting graph, cache optimization, memory mapping |
Displaying result #201 - #300 of 5849 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ >>] |
|