|
|
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 |
43 | Xiao Zhou 0001, Takao Nishizeki |
Algorithm for the Cost Edge-Coloring of Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 8(1), pp. 97-108, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
cost edge-coloring, tree, matching, bipartite graph |
43 | José R. Correa, Michel X. Goemans |
An approximate König's theorem for edge-coloring weighted bipartite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 398-406, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
bipartite edge coloring, rearrangeability of 3-stage clos networks, bin packing |
43 | Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai |
Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 37(3), pp. 187-209, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Sum Coloring, Scheduling dependent jobs, Approximation algorithms, Multicoloring |
43 | Hajo Broersma |
A General Framework for Coloring Problems: Old Results, New Results, and Open Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCCGGT ![In: Combinatorial Geometry and Graph Theory, Indonesia-Japan Joint Conference,IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers, pp. 65-79, 2003, Springer, 3-540-24401-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
computational complexity, graph coloring, planar graph, graph partitioning, forbidden subgraph |
43 | Venkatesan Guruswami, Sanjeev Khanna |
On the Hardness of 4-Coloring a 3-Colorable Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 15th Annual IEEE Conference on Computational Complexity, Florence, Italy, July 4-7, 2000, pp. 188-197, 2000, IEEE Computer Society, 0-7695-0674-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Graph Coloring, Hardness of approximation, PCP |
43 | Rajiv Gupta 0001, Mary Lou Soffa, Denise Ombres |
Efficient Register Allocation via Coloring Using Clique Separators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 16(3), pp. 370-386, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
clique separators, node priorities, graph coloring, spans, spill code, interference graph |
43 | Iyad A. Kanj, Andreas Wiese, Fenghui Zhang |
Local Algorithms for Edge Colorings in UDGs. ![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. 202-213, 2009, 978-3-642-11408-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
43 | Pilu Crescenzi, Miriam Di Ianni, Federico Greco, Gianluca Rossi, Paola Vocca |
Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings. ![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. 90-100, 2008, 978-3-540-92247-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
43 | Shuji Isobe, Xiao Zhou 0001, Takao Nishizeki |
A Linear Algorithm for Finding Total Colorings of Partial k-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 10th International Symposium, ISAAC '99, Chennai, India, December 16-18, 1999, Proceedings, pp. 347-356, 1999, Springer, 3-540-66916-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
41 | Garth Isaak |
Sum List Coloring Block Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(4), pp. 499-506, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Sum coloring, Block graphs, List coloring |
41 | Dimitris Achlioptas, Michael S. O. Molloy |
The Analysis of a List-Coloring Algorithm on a Random Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 204-212, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
list-coloring algorithm, k-coloring algorithm, tight asymptotic analysis, performance, Markov chains, random graph, differential equations, graph colouring |
41 | David Eppstein |
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. ![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. 329-337, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
41 | Xiao Zhou 0001, Takao Nishizeki |
Edge-Coloring and f-Coloring for Various Classes of 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. 199-207, 1994, Springer, 3-540-58325-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
41 | Mathieu Bouchard, Alain Hertz, Guy Desaulniers |
Lower bounds and a tabu search algorithm for the minimum deficiency problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 17(2), pp. 168-191, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Minimum deficiency problem, Tabu search, Edge coloring |
41 | Sebastian Hack, Gerhard Goos |
Copy coalescing by graph recoloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the ACM SIGPLAN 2008 Conference on Programming Language Design and Implementation, Tucson, AZ, USA, June 7-13, 2008, pp. 227-237, 2008, ACM, 978-1-59593-860-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
graph coloring, register allocation, ssa form |
41 | Lian Li 0002, Quan Hoang Nguyen 0001, Jingling Xue |
Scratchpad allocation for data aggregates in superperfect graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCTES ![In: Proceedings of the 2007 ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES'07), San Diego, California, USA, June 13-15, 2007, pp. 207-216, 2007, ACM, 978-1-59593-632-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
SPM allocation, interval coloring, superperfect graph, scratchpad memory, SPM |
41 | Geir Agnarsson, Magnús M. Halldórsson |
Strong Colorings of Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers, pp. 253-266, 2004, Springer, 3-540-24574-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
strong coloring, composition width, approximation, hypergraph |
41 | Omri Traub, Glenn H. Holloway, Michael D. Smith 0001 |
Quality and Speed in Linear-scan Register Allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation (PLDI), Montreal, Canada, June 17-19, 1998, pp. 142-151, 1998, ACM, 0-89791-987-4. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
binpacking, global register allocation, linear scan, graph coloring |
39 | Rajeev Kumar, Paresh Tolay, Siddharth Tiwary |
Enhancing solution quality of the biobjective graph coloring problem using hybridization of EA: biobjective graph coloring problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2008, Proceedings, Atlanta, GA, USA, July 12-16, 2008, pp. 547-554, 2008, ACM, 978-1-60558-130-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
soft graph coloring, genetic algorithm, evolutionary algorithm, heuristics, combinatorial optimization, multi-objective optimization, optimization methods, pareto front |
38 | Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos |
Time slot scheduling of compatible jobs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 10(2), pp. 111-127, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Weighted coloring, Chromatic scheduling, Approximations, Edge coloring, Batch scheduling |
38 | Xia Zhang, Guizhen Liu |
A Class of Graphs of f -Class 1. ![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. 362-369, 2007, Springer, 978-3-540-72587-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
simple graph, f-coloring, f-chromatic index, Edge-coloring |
38 | Ken-ichi Kawarabayashi, Erik D. Demaine, MohammadTaghi Hajiaghayi |
Additive approximation algorithms for list-coloring minor-closed class of graphs. ![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. 1166-1175, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
38 | Andreas Wiese, Evangelos Kranakis |
Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs. ![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. 372-383, 2008, 978-3-540-92247-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
38 | Leah Epstein, Asaf Levin |
On the Max Coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers, pp. 142-155, 2007, Springer, 978-3-540-77917-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Lyes Dekar, Brice Effantin, Hamamache Kheddouci |
An Incremental Distributed Algorithm for a Partial Grundy Coloring of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPA ![In: Parallel and Distributed Processing and Applications, 5th International Symposium, ISPA 2007, Niagara Falls, Canada, August 29-31, 2007, Proceedings, pp. 170-181, 2007, Springer, 978-3-540-74741-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Xuxian Jiang, Aaron Walters, Dongyan Xu, Eugene H. Spafford, Florian P. Buchholz, Yi-Min Wang |
Provenance-Aware Tracing ofWorm Break-in and Contaminations: A Process Coloring Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: 26th IEEE International Conference on Distributed Computing Systems (ICDCS 2006), 4-7 July 2006, Lisboa, Portugal, pp. 38, 2006, IEEE Computer Society, 0-7695-2540-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Brice Effantin, Hamamache Kheddouci |
A Distributed Algorithm for a b-Coloring of a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPA ![In: Parallel and Distributed Processing and Applications, 4th International Symposium, ISPA 2006, Sorrento, Italy, December 4-6, 2006, Proceedings, pp. 430-438, 2006, Springer, 3-540-68067-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Iwona Cieslik |
On-line coloring and cliques covering for KKs, t-free graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 42(1), pp. 1-20, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
38 | Amos Fiat, Meital Levy, Jirí Matousek 0001, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner 0001, Emo Welzl |
Online conflict-free coloring for intervals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 545-554, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
38 | Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav |
On the Minimum Load Coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Papers, pp. 15-26, 2005, Springer, 3-540-32207-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
38 | Jérôme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier |
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings, pp. 896-907, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
38 | Amin Coja-Oghlan |
Coloring Semirandom Graphs Optimally. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, pp. 383-395, 2004, Springer, 3-540-22849-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
38 | Dániel Marx |
Parameterized Coloring Problems on Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings, pp. 83-95, 2004, Springer, 3-540-23071-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
38 | Irit Dinur, Oded Regev 0001, Clifford D. Smyth |
The Hardness of 3 - Uniform Hypergraph Coloring. ![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. 33-, 2002, IEEE Computer Society, 0-7695-1822-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
38 | Assefaw Hadish Gebremedhin, Fredrik Manne, Alex Pothen |
Parallel Distance-k Coloring Algorithms for Numerical Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2002, Parallel Processing, 8th International Euro-Par Conference Paderborn, Germany, August 27-30, 2002, Proceedings, pp. 912-921, 2002, Springer, 3-540-44049-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
38 | Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani |
Fault Tolerant Distributed Coloring Algorithms that Stabilize in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 15-19 April 2002, Fort Lauderdale, FL, USA, CD-ROM/Abstracts Proceedings, 2002, IEEE Computer Society, 0-7695-1573-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
38 | Luís Paquete, Thomas Stützle |
An Experimental Investigation of Iterated Local Search for Coloring Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoWorkshops ![In: Applications of Evolutionary Computing, EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN, Kinsale, Ireland, April 3-4, 2002, Proceedings, pp. 122-131, 2002, Springer, 3-540-43432-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
38 | Eran Halperin, Ram Nathaniel, Uri Zwick |
Coloring k-colorable graphs using smaller palettes. ![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. 319-326, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
38 | Benjamin Doerr, Anand Srivastav |
Recursive Randomized Coloring Beats Fair Dice Random Colorings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings, pp. 183-194, 2001, Springer, 3-540-41695-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
38 | Petter Kristiansen, Jan Arne Telle |
Generalized H-Coloring of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings, pp. 456-466, 2000, Springer, 3-540-41255-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
38 | Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai |
Sum Multi-coloring of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '99, 7th Annual European Symposium, Prague, Czech Republic, July 16-18, 1999, Proceedings, pp. 390-401, 1999, Springer, 3-540-66251-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
38 | Michael Krivelevich, Benny Sudakov |
Approximate Coloring of Uniform Hypergraphs (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '98, 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings, pp. 477-489, 1998, Springer, 3-540-64848-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
38 | Stefano Leonardi 0001, Andrea Vitaletti |
Randomized Lower Bounds for Online Path Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM ![In: Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM'98, Barcelona, Spain, October 8-10, 1998, Proceedings, pp. 232-247, 1998, Springer, 3-540-65142-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
38 | Edouard Bugnion, Jennifer-Ann M. Anderson, Todd C. Mowry, Mendel Rosenblum, Monica S. Lam |
Compiler-Directed Page Coloring for Multiprocessors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASPLOS ![In: ASPLOS-VII Proceedings - Seventh International Conference on Architectural Support for Programming Languages and Operating Systems, Cambridge, Massachusetts, USA, October 1-5, 1996., pp. 244-255, 1996, ACM Press, 0-89791-767-7. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
38 | Damon Kaller, Arvind Gupta, Thomas C. Shermer |
The Chi-t-Coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings, pp. 409-420, 1995, Springer, 3-540-59042-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
38 | Martin C. Carlisle, Errol L. Lloyd |
On the k-Coloring of Intervals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCI ![In: Advances in Computing and Information - ICCI'91, International Conference on Computing and Information, Ottawa, Canada, May 27-29, 1991, Proceedings, pp. 90-101, 1991, Springer, 3-540-54029-6. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
38 | Arol Ambler, Robert Trawick |
Chatin's Graph Coloring Algorithm as a Method for Assigning Positions to Diana Attributes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGPLAN Notices ![In: ACM SIGPLAN Notices 18(2), pp. 37-38, 1983. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
38 | David S. Johnson, Michael A. Trick (eds.) |
Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993 ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![DIMACS/AMS, 978-0-8218-6609-2 The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
38 | Michael A. Trick |
Appendix: Second DIMACS Challenge test problems. ![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. 653-657, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | Arun Jagota, Laura A. Sanchis, Ravikanth Ganesan |
Approximately solving Maximum Clique using neural network and related heuristics. ![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. 169-204, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | Mark Brockington, Joseph C. Culberson |
Camouflaging independent sets in quasi-random graphs. ![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. 75-88, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | William M. Spears |
Simulated annealing for hard satisfiability problems. ![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. 533-557, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | Brigitte Jaumard, Mihnea Stan, Jacques Desrosiers |
Tabu search and a quadratic relaxation for the Satisfiability problem. ![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. 457-477, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | Craig A. Morgenstern |
Distributed coloration neighborhood search. ![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. 335-357, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | Joseph C. Culberson, Feng Luo |
Exploring the k-colorable landscape with Iterated Greedy. ![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. 245-284, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | Luana E. Gibbons, Donald W. Hearn, Panos M. Pardalos |
A continuous based heuristic for the maximum clique problem. ![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. 103-124, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | Joseph Cheriyan, William H. Cunningham, Levent Tunçel, Yaoguang Wang |
A linear programming and rounding approach to max 2-sat. ![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. 395-413, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | Tal Grossman |
Applying the INN model to the Maximum Clique problem. ![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. 125-145, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | Egon Balas, William Niehaus |
Finding large cliques in arbitrary graphs by bipartite matching. ![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. 29-51, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | Allen Van Gelder, Yumi K. Tsuji |
Satisfiability testing with more reasoning and less guessing. ![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. 559-586, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | Steven E. Hampson, Dennis F. Kibler |
Large plateaus and plateau search in Boolean Satisfiability problems: When to give up searching and start again. ![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. 437-455, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | Daniele Pretolani |
Efficiency and stability of hypergraph SAT algorithms. ![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. 479-498, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | Mauricio G. C. Resende, Thomas A. Feo |
A GRASP for 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. 499-520, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | Mark K. Goldberg, Reid D. Rivenburgh |
Constructing cliques using restricted backtracking. ![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. 89-101, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | Patrick Soriano, Michel Gendreau |
Tabu search algorithms for the maximum clique problem. ![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. 221-242, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | Carlo Mannino, Antonio Sassano |
Edge projection and the maximum cardinality stable set problem. ![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. 205-219, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | Jean-Marie Bourjolly, Paul Gill, Gilbert Laporte, Hélène Mercure |
An exact quadratic 0-1 algorithm for the stable set problem. ![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. 53-73, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | Bart Selman, Henry A. Kautz, Bram Cohen |
Local search strategies for satisfiability testing. ![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. 521-531, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | Steven Homer, Marcus Peinado |
Experiments with polynomial-time CLIQUE approximation algorithms on very large graphs. ![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. 147-167, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | Yuichi Asahiro, Kazuo Iwama, Eiji Miyano |
Random generation of test instances with controlled attributes. ![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. 377-393, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | Olivier Dubois 0002, Pascal André, Yacine Boufkhad, Jacques Carlier |
SAT versus UNSAT. ![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. 415-436, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | Richard J. Wallace, Eugene C. Freuder |
Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiability problems. ![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. 587-615, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | Egon Balas, Sebastián Ceria, Gérard Cornuéjols, Gábor Pataki |
Polyhedral methods for the maximum clique problem. ![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. 11-28, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
36 | Paresh Tolay, Rajeev Kumar |
Evolution of hyperheuristics for the biobjective graph coloring problem using multiobjective genetic programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2009, Proceedings, Montreal, Québec, Canada, July 8-12, 2009, pp. 1939-1940, 2009, ACM, 978-1-60558-325-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
soft graph coloring, evolutionary algorithm, genetic programming, heuristics, combinatorial optimization, multi-objective optimization, optimization methods, pareto front |
36 | Haytham Elghazel, Khalid Benabdeslem, Hamamache Kheddouci |
McSOM: Minimal Coloring of Self-Organizing Map. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADMA ![In: Advanced Data Mining and Applications, 5th International Conference, ADMA 2009, Beijing, China, August 17-19, 2009. Proceedings, pp. 128-139, 2009, Springer, 978-3-642-03347-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
minimal coloring, neighborhood relations, clustering, Self-organizing map |
36 | Peter Sanders 0001, David Steurer |
An asymptotic approximation scheme for multigraph edge coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(2), pp. 21:1-21:24, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
chromatic index, data migration, Edge coloring, multigraphs |
36 | Lilia Paradis, Qi Han 0001 |
TIGRA: Timely Sensor Data Collection Using Distributed Graph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PerCom ![In: Sixth Annual IEEE International Conference on Pervasive Computing and Communications (PerCom 2008), 17-21 March 2008, Hong Kong, pp. 264-268, 2008, IEEE Computer Society, 978-0-7695-3113-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Wireless Sensor Networks, Real Time, Graph Coloring, Data Collection |
36 | Luis Ceze, Christoph von Praun, Calin Cascaval, Pablo Montesinos, Josep Torrellas |
Concurrency control with data coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MSPC ![In: Proceedings of the 2008 ACM SIGPLAN workshop on Memory Systems Performance and Correctness: held in conjunction with the Thirteenth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS '08), Seattle, Washington, USA, March 2, 2008, pp. 6-10, 2008, ACM, 978-1-60558-049-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
data coloring, concurrency control, programming model |
36 | Huimin Song, Jianliang Wu, Guizhen Liu |
The Equitable Edge-Coloring of Series-Parallel 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. 457-460, 2007, Springer, 978-3-540-72587-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
equitable, edge-coloring, series-parallel graph |
36 | Michael O. Albertson, Bojan Mohar |
Coloring Vertices and Faces of Locally Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 22(3), pp. 289-295, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Vertex face coloring, 1-embedded, Locally planar |
36 | Gary A. Kochenberger, Fred W. Glover, Bahram Alidaee, César Rego |
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 139(1), pp. 229-241, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
combinatorial optimization, tabu search, graph coloring |
36 | Marisa Gil, Ruben Pinilla |
Thread coloring: a scheduler proposal from user to hardware threads. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGOPS Oper. Syst. Rev. ![In: ACM SIGOPS Oper. Syst. Rev. 39(2), pp. 54-70, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
hyper-threading, thread coloring, scheduling, multithreaded, SMT, linux kernel |
36 | Andrew Lim 0001, Yi Zhu 0007, Q. Lou, Brian Rodrigues |
Heuristic methods for graph coloring problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), Santa Fe, New Mexico, USA, March 13-17, 2005, pp. 933-939, 2005, ACM, 1-58113-964-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
optimization, heuristics, tabu search, graph coloring |
36 | Toshimitsu Masuzawa, Sébastien Tixeuil |
A Self-stabilizing Link-Coloring Protocol Resilient to Unbounded Byzantine Faults in Arbitrary Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: Principles of Distributed Systems, 9th International Conference, OPODIS 2005, Pisa, Italy, December 12-14, 2005, Revised Selected Papers, pp. 118-129, 2005, Springer, 3-540-36321-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
link-coloring, fault tolerance, self-stabilization, distributed protocol, Byzantine fault, fault containment |
36 | Thomas Moscibroda, Roger Wattenhofer |
Coloring unstructured radio networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada, USA, pp. 39-48, 2005, ACM, 1-58113-986-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
sensor networks, ad hoc networks, coloring, initialization, radio network, asynchronous wake-up |
36 | Vincenzo Cutello, Giuseppe Nicosia |
A Clonal Selection Algorithm for Coloring, Hitting Set and Satisfiability Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WIRN/NAIS ![In: Neural Nets, 16th Italian Workshop on Neural Nets, WIRN 2005, and International Workshop on Natural and Artificial Immune Systems, NAIS 2005, Vietri sul Mare, Italy, June 8-11, 2005, Revised Selected Papers, pp. 324-337, 2005, Springer, 3-540-33183-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Minimum Hitting Set problem, Evolutionary Computation, Combinatorial Optimization, Satisfiability, Immune Algorithms, Clonal Selection Algorithms, Information Gain, Graph coloring problem |
36 | Nicolas Barnier, Pascal Brisset |
Graph Coloring for Air Traffic Flow Management. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 130(1-4), pp. 163-178, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
air traffic flow management, route network, graph coloring, constraint programming, greedy algorithm, cliques |
36 | Madhav V. Marathe, Alessandro Panconesi, Larry D. Risinger Jr. |
An experimental study of a simple, distributed edge-coloring algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 9, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
experimental analysis of algorithms, scheduling, Distributed algorithms, high performance computing, randomized algorithms, edge coloring |
36 | Michel Vasquez |
New Results on the Queens_n2 Graph Coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 10(4), pp. 407-413, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
queens graphs, cliques based filtering, graph coloring, independent sets |
36 | Geir Agnarsson, Ágúst S. Egilsson, Magnús M. Halldórsson |
Proper Down-Coloring Simple Acyclic Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AGTIVE ![In: Applications of Graph Transformations with Industrial Relevance, Second International Workshop, AGTIVE 2003, Charlottesville, VA, USA, September 27 - October 1, 2003, Revised Selected and Invited Papers, pp. 299-312, 2003, Springer, 3-540-22120-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
multidimensional clustering, acyclic digraph, ancestor, descendant, down-set, Relational databases, indexing, hypergraph, poset, digraph, vertex coloring, bitmap indexing |
36 | Vincenzo Cutello, Giuseppe Nicosia, Mario Pavone |
A Hybrid Immune Algorithm with Information Gain for the Graph Coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation - GECCO 2003, Genetic and Evolutionary Computation Conference, Chicago, IL, USA, July 12-16, 2003. Proceedings, Part I, pp. 171-182, 2003, Springer, 3-540-40602-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Combinatorial optimization, Immune Algorithm, Information Gain, Graph coloring problem |
36 | Jie Qiu 0002, Seah Hock Soon, Feng Tian 0006, Quan Chen, Konstantin Melikhov |
Computer-Assisted Auto Coloring by Region Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PG ![In: 11th Pacific Conference on Computer Graphics and Applications, PG 2003, Canmore, Canada, October 8-10, 2003, pp. 175-184, 2003, IEEE Computer Society, 0-7695-2028-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Auto Coloring, Master Frame, Region Matching, Cel Animation |
36 | Pablo E. Coll, Javier Marenco, Isabel Méndez-Díaz, Paula Zabala |
Facets of the Graph Coloring Polytope. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 116(1-4), pp. 79-90, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
facets of polyhedra, integer programming, graph coloring |
36 | Hung Quang Ngo, Ding-Zhu Du, Ronald L. Graham |
New Bounds on a Hypercube Coloring Problem and Linear Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCC ![In: 2001 International Symposium on Information Technology (ITCC 2001), 2-4 April 2001, Las Vegas, NV, USA, pp. 542-546, 2001, IEEE Computer Society, 0-7695-1062-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
hypercube, coloring, linear codes |
36 | David R. Karger, Rajeev Motwani 0001, Madhu Sudan 0001 |
Approximate Graph Coloring by Semidefinite Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 45(2), pp. 246-265, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
approximation algorithms, NP-completeness, randomized algorithms, graph coloring, chromatic number |
36 | Xiao-Tao Chen, Fred J. Meyer, Fabrizio Lombardi |
Structural diagnosis of interconnects by coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Design Autom. Electr. Syst. ![In: ACM Trans. Design Autom. Electr. Syst. 3(2), pp. 249-271, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
interconnect, diagnosis, graph coloring, syndrome, balanced code |
36 | Thomas J. Sager, Shi-Jen Lin |
A Color-Exchange Algorithm for Exact Graph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Great Lakes Computer Science Conference ![In: Computing in the 90's, The First Great Lakes Computer Science Conference, Kalamazzo, Michigan, USA, October 18-20, 1989, Proceedings, pp. 22-28, 1989, Springer, 3-540-97628-0. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
scheduling, algorithms, NP-Complete, branch-and-bound, graph-coloring, chromatic number |
36 | Yen-Hung Lin, Yih-Lang Li |
Double patterning lithography aware gridless detailed routing with innovative conflict graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 47th Design Automation Conference, DAC 2010, Anaheim, California, USA, July 13-18, 2010, pp. 398-403, 2010, ACM, 978-1-4503-0002-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
double patterning, gridless model, detailed routing |
36 | Georg Gottlob, Stephanie Tien Lee, Gregory Valiant |
Size and treewidth bounds for conjunctive queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2009, June 19 - July 1, 2009, Providence, Rhode Island, USA, pp. 45-54, 2009, ACM, 978-1-60558-553-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
size bounds, database theory, conjunctive queries, treewidth |
36 | Irene Finocchi, Emanuele G. Fusco, Rossella Petreschi |
A Note on Algebraic Hypercube Colorings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITNG ![In: Fifth International Conference on Information Technology: New Generations (ITNG 2008), 7-8 April 2008, Las Vegas, Nevada, USA, pp. 869-874, 2008, IEEE Computer Society, 978-0-7695-3099-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
Displaying result #101 - #200 of 5849 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ >>] |
|