|
|
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 |
124 | Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman 0001 |
Approximating interval coloring and max-coloring in chordal graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 10, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Graph coloring, chordal graphs, dynamic storage allocation, perfect graphs |
108 | Guillaume Fertin, André Raspaud, Bruce A. Reed |
On Star Coloring of Graphs. ![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. 140-153, 2001, Springer, 3-540-42707-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
proper coloring, star coloring, acyclic coloring, graphs, treewidth, vertex coloring |
93 | Sariel Har-Peled, Shakhar Smorodinsky |
On conflict-free coloring of points and simple regions in the plane. ![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. 114-123, 2003, ACM, 1-58113-663-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
coloring, cellular network, frequency assignment |
91 | Leonid Barenboim, Michael Elkin |
Distributed (delta+1)-coloring in linear (in delta) time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 111-120, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
defective-coloring, distributed algorithms, coloring |
88 | Sriram V. Pemmaraju, Aravind Srinivasan |
The Randomized Coloring Procedure with Symmetry-Breaking. ![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. 306-319, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
88 | Sriram V. Pemmaraju, Rajiv Raman 0001 |
Approximation Algorithms for the Max-coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, pp. 1064-1075, 2005, Springer, 3-540-27580-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
81 | Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Alfredo Navarra |
On the Complexity of Distributed Greedy Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, pp. 482-484, 2007, Springer, 978-3-540-75141-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
81 | Kishore Kothapalli, Christian Scheideler, Melih Onus, Christian Schindelhauer |
Distributed coloring in O~(⎷(log n)) bit rounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), Proceedings, 25-29 April 2006, Rhodes Island, Greece, 2006, IEEE. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
79 | Xuejun Yang, Yu Deng 0001, Li Wang 0027, Xiaobo Yan, Jing Du 0002, Ying Zhang 0032, Guibin Wang, Tao Tang 0001 |
SRF Coloring: Stream Register File Allocation via Graph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 24(1), pp. 152-164, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
SRF coloring, stream register file, memory management, compiler optimization, graph coloring, stream processor |
79 | Xiao Zhou 0001, Yuki Matsuo, Takao Nishizeki |
List Total Colorings of Series-Parallel Graphs. ![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. 172-181, 2003, Springer, 3-540-40534-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
77 | Rei Odaira, Takuya Nakaike, Tatsushi Inagaki, Hideaki Komatsu, Toshio Nakatani |
Coloring-based coalescing for graph coloring register allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CGO ![In: Proceedings of the CGO 2010, The 8th International Symposium on Code Generation and Optimization, Toronto, Ontario, Canada, April 24-28, 2010, pp. 160-169, 2010, ACM, 978-1-60558-635-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
register allocation, register coalescing |
77 | Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman 0001 |
Approximating Interval Coloring and Max-Coloring in Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental and Efficient Algorithms, Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings, pp. 399-416, 2004, Springer, 3-540-22067-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
76 | Ken-ichi Kawarabayashi, Bojan Mohar |
List-color-critical graphs on a fixed surface. ![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. 1156-1165, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
critical graphs, surface, list-coloring |
72 | Jian Ni, R. Srikant 0001, Xinzhou Wu |
Coloring spatial point processes with applications to peer discovery in large wireless networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMETRICS ![In: SIGMETRICS 2010, Proceedings of the 2010 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, New York, New York, USA, 14-18 June 2010, pp. 167-178, 2010, ACM, 978-1-4503-0038-4. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
coloring algorithms, spatial point processes, wireless networks, channel assignment |
72 | Xiao Zhang, Sandhya Dwarkadas, Kai Shen |
Towards practical page coloring-based multicore cache management. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EuroSys ![In: Proceedings of the 2009 EuroSys Conference, Nuremberg, Germany, April 1-3, 2009, pp. 89-102, 2009, ACM, 978-1-60558-482-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
page coloring, resource management, multi-core, cache partitioning |
72 | Fabian Kuhn, Roger Wattenhofer |
On the complexity of distributed graph coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, Denver, CO, USA, July 23-26, 2006, pp. 7-15, 2006, ACM, 1-59593-384-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
distributed algorithms, locality, graph coloring, chromatic number, symmetry breaking, neighborhood graph |
71 | Andreas Brandstädt, Feodor F. Dragan, Yang Xiang, Chenyu Yan |
Generalized Powers of Graphs and Their Algorithmic Use. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings, pp. 423-434, 2006, Springer, 3-540-35753-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
69 | Haytham Elghazel, Tetsuya Yoshida, Véronique Deslandres, Mohand-Said Hacid, Alain Dussauchoy |
A New Greedy Algorithm for Improving b-Coloring Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GbRPR ![In: Graph-Based Representations in Pattern Recognition, 6th IAPR-TC-15 International Workshop, GbRPR 2007, Alicante, Spain, June 11-13, 2007, Proceedings, pp. 228-239, 2007, Springer, 978-3-540-72902-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
graph b-coloring, graph re-coloring, clustering |
69 | Rajiv Gandhi, Bradford Greening, Sriram V. Pemmaraju, Rajiv Raman 0001 |
Sub-coloring and Hypo-coloring Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers, pp. 122-132, 2009, 978-3-642-11408-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
67 | Hal A. Kierstead, Daqing Yang |
Very Asymmetric Marking Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 22(2), pp. 93-107, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
coloring number, competitive coloring, planar graph |
67 | Uriel Feige, Mohit Singh |
Edge Coloring and Decompositions of Weighted Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings, pp. 405-416, 2008, Springer, 978-3-540-87743-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
65 | Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos |
Probabilistic graph-coloring in bipartite and split graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 17(3), pp. 274-311, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Probabilistic optimization, Approximation algorithms, Graph coloring |
65 | Kyriaki Ioannidou, Stavros D. Nikolopoulos |
Colinear Coloring on Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings, pp. 117-128, 2009, Springer, 978-3-642-00201-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Colinear coloring, threshold graphs, quasi-threshold graphs, algorithms, complexity, chordal graphs, chromatic number |
65 | Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma |
Three Complexity Results on Coloring Pk-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers, pp. 95-104, 2009, Springer, 978-3-642-10216-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
P k -free graph, computational complexity, graph coloring |
65 | Peter Damaschke |
Distributed Soft Path Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings, pp. 523-534, 2003, Springer, 3-540-00623-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
distributed algorithms, locality, randomization, coloring |
64 | Guy Even, Zvi Lotker, Dana Ron, Shakhar Smorodinsky |
Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks. ![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. 691-700, 2002, IEEE Computer Society, 0-7695-1822-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
62 | Ke Chen 0006, Haim Kaplan, Micha Sharir |
Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 5(2), pp. 16:1-16:24, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Conflict free coloring, online algorithms, coloring |
62 | Jihui Wang, Sumei Zhang, Jianfeng Hou |
On f -Edge Cover-Coloring of Simple 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. 448-452, 2007, Springer, 978-3-540-72587-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Simple graph, f-edge cover-coloring, Edge-coloring |
62 | Fabian Kuhn |
Weak graph colorings: distributed algorithms and applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, pp. 138-144, 2009, ACM, 978-1-60558-606-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
deterministic symmetry breaking, distributed algorithms, locality, graph coloring |
60 | Thang Nguyen Bui, ThanhVu H. Nguyen |
An agent-based algorithm for generalized graph colorings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2006, Proceedings, Seattle, Washington, USA, July 8-12, 2006, pp. 19-26, 2006, ACM, 1-59593-186-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
bandwidth coloring, bandwidth multicoloring, graph coloring, multicoloring |
60 | Telikepalli Kavitha, Julián Mestre |
Max-Coloring Paths: Tight Bounds and Extensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 87-96, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
60 | Jing Liu 0006, Weicai Zhong, Jinshu Li |
Multiagent Evolutionary Algorithm for T-coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEAL ![In: Simulated Evolution and Learning, 7th International Conference, SEAL 2008, Melbourne, Australia, December 7-10, 2008. Proceedings, pp. 289-298, 2008, Springer, 978-3-540-89693-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
60 | Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir |
Connected Coloring Completion for General Graphs: Algorithms and Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings, pp. 75-85, 2007, Springer, 978-3-540-73544-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Topics Algorithms and Complexity, Bioinformatics |
60 | Chun-Chen Hsu, Pangfeng Liu, Da-Wei Wang 0004, Jan-Jan Wu |
Generalized Edge Coloring for Channel Assignment in Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 2006 International Conference on Parallel Processing (ICPP 2006), 14-18 August 2006, Columbus, Ohio, USA, pp. 82-92, 2006, IEEE Computer Society, 0-7695-2636-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
60 | Sriram V. Pemmaraju, Rajiv Raman 0001, Kasturi R. Varadarajan |
Buffer minimization using max-coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 562-571, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
58 | Gary Lewandowski, Anne Condon |
Experiments with parallel graph coloring heuristics and applications of graph coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 309-334, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
57 | Leonid Barenboim, Michael Elkin |
Deterministic distributed vertex coloring in polylogarithmic time. ![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. 410-419, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
arbdefective-coloring, arboricity, partial-orientation |
57 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret |
Minimum entropy coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 16(4), pp. 361-377, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Complexity, Entropy, Graph coloring |
57 | Lyes Dekar, Hamamache Kheddouci |
Distance-2 Self-stabilizing Algorithm for a b-Coloring of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSS ![In: Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings, pp. 19-31, 2008, Springer, 978-3-540-89334-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
b-coloring, data mining, clustering, graphs, self-stabilizing algorithm |
57 | Mathieu Couture, Michel Barbeau, Prosenjit Bose, Paz Carmi, Evangelos Kranakis |
Location Oblivious Distributed Unit Disk Graph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: Structural Information and Communication Complexity, 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings, pp. 222-233, 2007, Springer, 978-3-540-72918-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
location oblivious algorithms, approximation algorithms, distributed algorithms, coloring, unit disk graph |
57 | Benjamin Doerr |
Structured Randomized Rounding and Coloring. ![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. 461-471, 2001, Springer, 3-540-42487-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
hypergraph coloring, randomized algorithms, integer linear programming, discrepancy, randomized rounding |
57 | Nobuo Tsuda |
Fault-Tolerant Processor Arrays Using Additional Bypass Linking Allocated by Graph-Node Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 49(5), pp. 431-442, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
k-out-of-n redundancy, additional bypass linking, graph-node coloring, enhanced communication and broadcast, fault tolerance, tree, mesh, Processor array |
57 | Preston Briggs, Keith D. Cooper, Linda Torczon |
Improvements to Graph Coloring Register Allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 16(3), pp. 428-455, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
code generation, graph coloring, register allocation |
57 | Shlomo Moran, Sagi Snir |
Efficient Approximation of Convex Recolorings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings, pp. 192-208, 2005, Springer, 3-540-28239-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
53 | Daniel Kobler, Udi Rotics |
Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 468-476, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
coloring, dominating set, polynomial algorithms, edge-coloring, clique-width, edge-dominating set |
53 | Zdenek Dvorák 0001, Daniel Král, Robin Thomas 0001 |
Coloring triangle-free graphs on surfaces. ![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. 120-129, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
53 | Magnús M. Halldórsson, Hadas Shachnai |
Batch Coloring Flat Graphs and Thin. ![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. 198-209, 2008, Springer, 978-3-540-69900-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
53 | Steffen Mecke |
MAC Layer and Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms for Sensor and Ad Hoc Networks ![In: Algorithms for Sensor and Ad Hoc Networks, Advanced Lectures [result from a Dagstuhl seminar]., pp. 63-80, 2007, Springer, 978-3-540-74990-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
53 | Leah Epstein, Meital Levy |
Online Interval Coloring with Packing Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings, pp. 295-307, 2005, Springer, 3-540-28702-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
53 | Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos |
Probabilistic Coloring of Bipartite and Split Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (4) ![In: Computational Science and Its Applications - ICCSA 2005, International Conference, Singapore, May 9-12, 2005, Proceedings, Part IV, pp. 202-211, 2005, Springer, 3-540-25863-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
53 | Gianluca De Marco, Andrzej Pelc |
Fast distributed graph coloring with O(Delta) colors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 630-635, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
50 | Johannes Schneider 0002, Roger Wattenhofer |
Coloring unstructured wireless multi-hop networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, pp. 210-219, 2009, ACM, 978-1-60558-396-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
bounded independence graphs, growth bounded graphs, unstructured radio networks, sensor networks, parallel algorithms, ad hoc networks, distributed algorithms, coloring, local algorithms, unit disk graphs |
50 | A. N. Trahtman |
Synchronizing Road Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP TCS ![In: Fifth IFIP International Conference On Theoretical Computer Science - TCS 2008, IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy, pp. 43-53, 2008, Springer, 978-0-387-09679-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
road coloring problem, synchronization, graph, deterministic finite automaton |
50 | Ke Chen 0006 |
How to play a coloring game against a color-blind adversary. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, Arizona, USA, June 5-7, 2006, pp. 44-51, 2006, ACM, 1-59593-340-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
conflict-free coloring, online algorithm |
50 | Xujin Chen, Zhiquan Hu, Wenan Zang |
Perfect Circular Arc Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 9(3), pp. 267-280, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
complexity, matching, graph coloring, perfect graph, circular-arc graph |
50 | Michael D. Smith 0001, Norman Ramsey, Glenn H. Holloway |
A generalized algorithm for graph-coloring register allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation 2004, Washington, DC, USA, June 9-11, 2004, pp. 277-288, 2004, ACM, 1-58113-807-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
graph coloring, register allocation |
50 | Akira Koseki, Hideaki Komatsu, Toshio Nakatani |
Preference-Directed Graph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the 2002 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Berlin, Germany, June 17-19, 2002, pp. 33-44, 2002, ACM, 1-58113-463-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
irregular-register architectures, graph coloring, register allocation, register coalescing |
50 | Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger |
Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings, pp. 160-169, 2002, Springer, 3-540-43866-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
computational complexity, graph coloring, planar graph, graph partitioning, forbidden subgraph |
50 | Robert Freimer |
Generalized map coloring for use in geographical information systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM-GIS ![In: ACM-GIS 2000, Proceedings of the Eighth ACM Symposium on Advances in Geographic Information Systems, November 10-11, 2000, Washington D.C., USA, pp. 167-173, 2000, ACM, 1-58113-319-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Dsatur heuristic, Heawood's m-pire problem, cartographic maps, GIS, coloring, map graphs |
50 | Avrim Blum |
New Approximation Algorithms for Graph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(3), pp. 470-516, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
approximation algorithms, graph coloring, chromatic number |
48 | Lian Li 0002, Hui Feng, Jingling Xue |
Compiler-directed scratchpad memory management via graph coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Archit. Code Optim. ![In: ACM Trans. Archit. Code Optim. 6(3), pp. 9:1-9:17, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
live range splitting, memory coloring, graph coloring, memory allocation, Scratchpad memory, register coalescing, software-managed cache |
48 | Benedito J. B. Fonseca Jr. |
An augmented graph-based coloring scheme to derive upper bounds for the performance of distributed schedulers in CSMA-based mobile ad hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCMC ![In: Proceedings of the International Conference on Wireless Communications and Mobile Computing, IWCMC 2006, Vancouver, British Columbia, Canada, July 3-6, 2006, pp. 761-766, 2006, ACM, 1-59593-306-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
coloring schemes, graph-based coloring schemes, performance upper bound, mobile ad hoc networks, graph theory, 802.11, scheduling algorithms, CSMA |
48 | Kazunori Mizuno, Seiichi Nishihara |
Local minimum structures of graph-coloring problems for stochastic constraint satisfaction algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2000), 13-15 November 2000, Vancouver, BC, Canada, pp. 366-369, 2000, IEEE Computer Society, 0-7695-0909-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
local minimum structures, stochastic constraint satisfaction, stochastic search algorithms, large-scale constraint satisfaction problems, locally minimal solutions, local constraint structures, LM pair, stochastic programming, operations research, graph colouring, hill-climbing, stepwise refinement, local minima, constraint theory, graph-coloring problems, graph-coloring problem |
48 | Edward C. Sewell |
An improved algorithm for exact graph coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 359-373, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
48 | Fred W. Glover, Mark Parker, Jennifer Ryan |
Coloring by tabu branch and bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 285-307, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
48 | Charles Fleurent, Jacques A. Ferland |
Object-oriented implementation of heuristic search methods for Graph Coloring, Maximum Clique, and Satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 619-652, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
48 | David S. Johnson, Michael A. Trick |
Foreword xiIntroduction to the Second DIMACS Challenge: Cliques, coloring, and satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 1-7, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
46 | Richard Beigel, David Eppstein |
3-Coloring in Time O(1.3446n): A No-MIS Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 444-452, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
duality (mathematics), 3-coloring, worst case time bounds, 3-edge-coloring, 3-list-coloring, common generalization, symbol-system satisfiability, duality transformation, computational complexity, computability, decidability, NP-complete problems, graph colouring, time bounds, 3-SAT |
46 | Andrea Vietri |
Arc-Coloring of Directed Hypergraphs and Brick-Coloring of Walls. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IV ![In: 8th International Conference on Information Visualisation, IV 2004, 14-16 July 2004, London, UK, pp. 394-399, 2004, IEEE Computer Society, 0-7695-2177-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
arc-coloring, brick, chromatic index, directed hypergraph, wall |
45 | Alan A. Bertossi, Maria Cristina Pinotti, Richard B. Tan |
Channel Assignment with Separation for Interference Avoidance in Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 14(3), pp. 222-235, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
cellular grids, bidimensional grids, L(2,1,1){hbox{-}}rm coloring, L(delta_1,1,ldots,1){hbox{-}}rm coloring, Wireless networks, interferences, channel assignment, rings |
45 | Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann |
Deconstructing Intractability: A Case Study for Interval Constrained Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 20th Annual Symposium, CPM 2009, Lille, France, June 22-24, 2009, Proceedings, pp. 207-220, 2009, Springer, 978-3-642-02440-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
45 | Xuxian Jiang, Florian P. Buchholz, Aaron Walters, Dongyan Xu, Yi-Min Wang, Eugene H. Spafford |
Tracing Worm Break-In and Contaminations via Process Coloring: A Provenance-Preserving Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 19(7), pp. 890-902, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
(viruses, worms, Trojan horses), Servers, Security and Protection |
45 | Panagiota N. Panagopoulou, Paul G. Spirakis |
A Game Theoretic Approach for Efficient Graph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 183-195, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
45 | Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, Rodica Mihai |
Comparing First-Fit and Next-Fit for Online Edge Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 89-99, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
45 | Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi |
"Rent-or-Buy" Scheduling and Cost Coloring Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings, pp. 84-95, 2007, Springer, 978-3-540-77049-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
45 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret |
Minimum Entropy Coloring. ![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. 819-828, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
45 | Guizhen Liu, Changqing Xu |
Some Topics on Edge-Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CJCDGCGT ![In: Discrete Geometry, Combinatorics and Graph Theory, 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, Xi'an, China, November 22-24, 2005, Revised Selected Papers, pp. 101-108, 2005, Springer, 978-3-540-70665-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
45 | Leah Epstein, Meital Levy |
Online Interval Coloring and Variants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, pp. 602-613, 2005, Springer, 3-540-27580-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
45 | Ioannis Caragiannis, Christos Kaklamanis |
Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings, pp. 258-269, 2004, Springer, 3-540-21236-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
45 | Ying Kong, Fan Wang 0003, Andrew Lim 0001, Songshan Guo |
A New Hybrid Genetic Algorithm for the Robust Graph Coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australian Conference on Artificial Intelligence ![In: AI 2003: Advances in Artificial Intelligence, 16th Australian Conference on Artificial Intelligence, Perth, Australia, December 3-5, 2003, Proceedings, pp. 125-136, 2003, Springer, 3-540-20646-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
45 | Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos |
The Complexity of Restrictive H-Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers, pp. 126-137, 2002, Springer, 3-540-00331-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
45 | Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos |
Weighted Node Coloring: When Stable Sets Are Expensive. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers, pp. 114-125, 2002, Springer, 3-540-00331-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
45 | C. R. Subramanian 0001 |
Coloring Sparse Random Graphs in Polynominal Average Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2000, 8th Annual European Symposium, Saarbrücken, Germany, September 5-8, 2000, Proceedings, pp. 415-426, 2000, Springer, 3-540-41004-X. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
45 | Keith D. Cooper, L. Taylor Simpson |
Live Range Splitting in a Graph Coloring Register Allocator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CC ![In: Compiler Construction, 7th International Conference, CC'98, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'98, Lisbon, Portugal, March 28 - April 4, 1998, Proceedings, pp. 174-187, 1998, Springer, 3-540-64304-4. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
45 | Shin-Ichi Nakano, Xiao Zhou 0001, Takao Nishizeki |
Edge-Coloring Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computer Science Today ![In: Computer Science Today: Recent Trends and Developments, pp. 172-183, 1995, Springer, 3-540-60105-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
45 | Fred C. Chow, John L. Hennessy |
The Priority-Based Coloring Approach to Register Allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 12(4), pp. 501-536, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
43 | Dhia Mahjoub, David W. Matula |
Experimental Study of Independent and Dominating Sets in Wireless Sensor Networks Using Graph Coloring Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WASA ![In: Wireless Algorithms, Systems, and Applications, 4th International Conference, WASA 2009, Boston, MA, USA, August 16-18, 2009. Proceedings, pp. 32-42, 2009, Springer, 978-3-642-03416-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
domatic partition problem, triangular lattice, Wireless Sensor Networks, graph coloring, dominating sets, independent sets, random geometric graphs |
43 | Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky |
Deterministic conflict-free coloring for intervals: From offline to online. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(4), pp. 44:1-44:18, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Online algorithms, coloring, cellular networks, frequency assignment, conflict free |
43 | Richard Cole 0001, Lukasz Kowalik |
New Linear-Time Algorithms for Edge-Coloring Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 50(3), pp. 351-368, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Algorithm, Planar graph, Edge-coloring, Linear-time |
43 | Pawel B. Myszkowski |
Solving Scheduling Problems by Evolutionary Algorithms for Graph Coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Metaheuristics for Scheduling in Industrial and Manufacturing Applications ![In: Metaheuristics for Scheduling in Industrial and Manufacturing Applications, pp. 145-167, 2008, Springer, 978-3-540-78984-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Evolutionary Algorithms, Graph Coloring, Multiprocessor scheduling, Assignment Problems, Timetabling, Genetic Operators |
43 | Frank Kammer, Torsten Tholey |
The Complexity of Minimum Convex Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 16-27, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Convex Coloring, Maximum Disjoint Paths Problem |
43 | Jirí Fiala 0001, Petr A. Golovach |
Complexity of the Packing Coloring Problem for Trees. ![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. 134-145, 2008, 978-3-540-92247-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Packing coloring, computational complexity, graph algorithm, chordal graph |
43 | Sanjukta Bhowmick, Paul D. Hovland |
Improving the Performance of Graph Coloring Algorithms through Backtracking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS (1) ![In: Computational Science - ICCS 2008, 8th International Conference, Kraków, Poland, June 23-25, 2008, Proceedings, Part I, pp. 873-882, 2008, Springer, 978-3-540-69383-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Graph Coloring, Backtracking |
43 | Chang-Wu Yu 0001 |
On the Complexity of the Max-Edge-Coloring Problem with Its Variants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESCAPE ![In: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers, pp. 350-361, 2007, Springer, 978-3-540-74449-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
multi-graphs, bipartite graphs, algorithm design, edge coloring |
43 | Alexa Sharp |
Distance Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pp. 510-521, 2007, Springer, 978-3-540-75519-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
power graphs, complexity threshold, Graph coloring |
43 | Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger |
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 44(4), pp. 343-361, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Computational complexity, Graph coloring, Planar graph, Graph partitioning, Forbidden subgraph |
43 | Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky |
Conflict-free coloring for intervals: from offline to online. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006, pp. 128-137, 2006, ACM, 1-59593-452-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
online algorithms, coloring, cellular networks, frequency assignment, conflict free |
43 | Jinhyuk Choi, Geehyuk Lee |
The Bifurcating Neuron Network 3 as Coloring Problem Solver and N-Ary Associative Memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICONIP (1) ![In: Neural Information Processing, 13th International Conference, ICONIP 2006, Hong Kong, China, October 3-6, 2006, Proceedings, Part I, pp. 437-446, 2006, Springer, 3-540-46479-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
bifurcating neuron, bifurcating neuron network, coloring problem, associative memory, pulse-coupled neural network |
43 | Tínaz Ekim, Dominique de Werra |
On Split-Coloring Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 10(3), pp. 211-225, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
split-coloring, vertex covering by split graphs, partitioning, packing |
43 | Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos |
Weighted Coloring: Further Complexity and Approximability Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTCS ![In: Theoretical Computer Science, 9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005, Proceedings, pp. 205-214, 2005, Springer, 3-540-29106-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
weighted coloring, line graph of bipartite graphs, Approximation algorithm, NP-complete problems, interval graphs, partial k-tree |
Displaying result #1 - #100 of 5849 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|