|
|
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 |
24 | Benjamin Doerr |
Balanced Coloring: Equally Easy for All Numbers of Colors? ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings, pp. 112-120, 2002, Springer, 3-540-43283-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Subhash Khot |
Hardness results for approximate hypergraph coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 351-359, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Uriel Feige, Eran Ofek, Udi Wieder |
Approximating Maximum Edge Coloring in Multigraphs. ![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. 108-121, 2002, Springer, 3-540-44186-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Hiroshi Tamura, Kaoru Watanabe, Masakazu Sengoku, Shoji Shinoda |
On a new edge coloring related to multihop wireless networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APCCAS (2) ![In: IEEE Asia Pacific Conference on Circuits and Systems 2002, APCCAS 2002, Singapore, 16-18 December 2002, pp. 357-360, 2002, IEEE, 0-7803-7690-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Sven Oliver Krumke, Willem de Paepe, Jörg Rambau, Leen Stougie |
Online Bin Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, pp. 74-85, 2001, Springer, 3-540-42493-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Dimitris Fotakis 0001, Spiridon D. Likothanassis, Stamatis Stefanakos |
An Evolutionary Annealing Approach to Graph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoWorkshops ![In: Applications of Evolutionary Computing, EvoWorkshops 2001: EvoCOP, EvoFlight, EvoIASP, EvoLearn, and EvoSTIM, Como, Italy, April 18-20, 2001, Proceedings, pp. 120-129, 2001, Springer, 3-540-41920-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Howard A. Peelle |
Graph coloring in J: an introduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APL ![In: Proceedings of the 2001 International Conference on APL: An Arrays Odyssey, Yale University, New Haven, Connecticut, USA, June 25-28, 2001., pp. 77-82, 2001, ACM, 1-58113-419-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
J |
24 | Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss |
Coloring Mixed Hypertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings, pp. 279-289, 2000, Springer, 3-540-41183-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
24 | Chang-Sung Jeong, Sung-Up Cho, Sun-Chul Whang, Mi-Young Choi |
Parallel Edge Coloring of a Tree on a Mesh Connected Computer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP TCS ![In: Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000, Proceedings, pp. 76-83, 2000, Springer, 3-540-67823-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
24 | 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) |
SPAA ![In: Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2000, Bar Harbor, Maine, USA, July 9-13, 2000, pp. 166-175, 2000, ACM, 1-58113-185-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
24 | Philip N. Klein, Hsueh-I Lu |
Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings, pp. 387-396, 1998, Springer, 3-540-65385-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
24 | A. E. Eiben, J. K. van der Hauw |
Adaptive Penalties for Evolutionary Graph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artificial Evolution ![In: Artificial Evolution, Third European Conference, AE'97, Nîmes, France, 22-24 October 1997, Selected Papers, pp. 95-108, 1997, Springer, 3-540-64169-6. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
24 | Pierre Kelsen |
Neighborhood Graphs and Distributed Delta+1-Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '96, 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3-5, 1996, Proceedings, pp. 223-233, 1996, Springer, 3-540-61422-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
24 | Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan |
Approximate Hypergraph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '96, 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3-5, 1996, Proceedings, pp. 41-52, 1996, Springer, 3-540-61422-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
24 | Marina Papatriantafilou, Philippas Tsigas |
How a Rainbow Coloring Function Can Simulate Wait-Free Handshaking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1994, 19th International Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994, Proceedings, pp. 546-555, 1994, Springer, 3-540-58338-6. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
24 | Xiao Zhou 0001, Shin-Ichi Nakano, Takao Nishizeki |
A Parallel Algorithm for Edge-Coloring Partial k-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '94, 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings, pp. 359-369, 1994, Springer, 3-540-58218-5. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
24 | Martin Fürer, C. R. Subramanian 0001, C. E. Veni Madhavan |
Coloring Random Graphs in Polynomial Expected Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993, Proceedings, pp. 31-37, 1993, Springer, 3-540-57568-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
24 | Magnús M. Halldórsson, Mario Szegedy |
Lower Bounds for On-Line Graph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 27-29 January 1992, Orlando, Florida, USA., pp. 211-216, 1992, ACM/SIAM, 0-89791-466-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
24 | Zvi M. Kedem, Krishna V. Palem, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis |
Fast Parallel Algorithms for Coloring Random Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: 17th International Workshop, WG '91, Fischbachau, Germany, June 17-19, 1991, Proceedings, pp. 135-147, 1991, Springer, 3-540-55121-2. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
24 | Maciej Slusarek |
A Coloring Algorithm for Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1989, MFCS'89, Porabka-Kozubnik, Poland, August 28 - September 1, 1989, Proceedings, pp. 471-480, 1989, Springer, 3-540-51486-4. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
24 | Gregory J. Chaitin |
Register Allocation & Spilling via Graph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGPLAN Symposium on Compiler Construction ![In: Proceedings of the SIGPLAN '82 Symposium on Compiler Construction, Boston, Massachusetts, USA, June 23-25, 1982, pp. 98-105, 1982, ACM, 0-89791-074-5. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
24 | Gregory J. Chaitin |
Register allocation and spilling via graph 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. 66-74, 1982, ACM, 1-58113-623-4. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
22 | Kai Hwang 0001, Deyi Li |
Trusted Cloud Computing with Secure Resources and Data Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Internet Comput. ![In: IEEE Internet Comput. 14(5), pp. 14-22, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Internet clouds, trust overlays, data coloring, network security, data centers, reputation system, software watermarking |
22 | Bilel Derbel, El-Ghazali Talbi |
Distributed Node Coloring in the SINR Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: 2010 International Conference on Distributed Computing Systems, ICDCS 2010, Genova, Italy, June 21-25, 2010, pp. 708-717, 2010, IEEE Computer Society, 978-0-7695-4059-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
SINR Model, Distributed Algorithm, Coloring, Time Complexity, TDMA |
22 | Jue Xue |
Graph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 1444-1448, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Optimization, Algorithms, Approximation, Graph, Coloring |
22 | Cheng-Hsiung Hsieh, Chih-Ming Lin, Fung-Jung Chang |
Pseudo-Coloring with Histogram Interpolation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HIS (1) ![In: 9th International Conference on Hybrid Intelligent Systems (HIS 2009), August 12-14, 2009, Shenyang, China, pp. 9-12, 2009, IEEE Computer Society, 978-0-7695-3745-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
pseudo coloring, histogram interpolation, grey polynomial interpolation |
22 | Xuejun Yang, Li Wang 0027, Jingling Xue, Yu Deng 0001, Ying Zhang 0032 |
Comparability graph coloring for optimizing utilization of stream register files in stream processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPoPP ![In: Proceedings of the 14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP 2009, Raleigh, NC, USA, February 14-18, 2009, pp. 111-120, 2009, ACM, 978-1-60558-397-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
comparability graph coloring, stream programming, stream processor, software-managed cache |
22 | Jianliang Wu, Ping Wang |
A Linear Algorithm for Edge-Face Coloring 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. 389-396, 2007, Springer, 978-3-540-72587-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
edge-face coloring, series-parallel graph, decomposition tree |
22 | Xujin Chen, Xiaodong Hu 0001, Tianping Shuai |
Inapproximability and approximability of maximal tree routing and coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 11(2), pp. 219-229, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
coloring, multicast routing, maximum independent set |
22 | Irene Finocchi, Alessandro Panconesi, Riccardo Silvestri |
An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 41(1), pp. 1-23, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Distributed graph algorithms, Algorithm engineering, Vertex coloring |
22 | Philippe Meurdesoif |
Strengthening the Lovász Theta(G) bound for graph coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 102(3), pp. 577-588, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
SDP relaxation, Lovász number, Combinatorial optimization, Graph coloring |
22 | Todd Eisworth, Saharon Shelah |
Successors of singular cardinals and coloring theorems I. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 44(5), pp. 597-618, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Jonsson cardinals, coloring theorms, successors of singular cardinals |
22 | Michal Malafiejski, Krzysztof Giaro, Robert Janczewski, Marek Kubale |
Sum Coloring of Bipartite Graphs with Bounded Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 40(4), pp. 235-244, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Sum coloring, Chromatic sum, Bipartite graphs |
22 | Adam J. O'Donnell, Harish Sethu |
On achieving software diversity for improved network security using distributed coloring algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCS ![In: Proceedings of the 11th ACM Conference on Computer and Communications Security, CCS 2004, Washington, DC, USA, October 25-29, 2004, pp. 121-131, 2004, ACM, 1-58113-961-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
software monoculture, viruses and worms, network security, graph coloring, survivability, software diversity |
22 | Xuechao Li, Rong Luo |
Edge Coloring of Embedded Graphs with Large Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 19(3), pp. 393-401, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Edge chromatic number, Euler contribution, Edge coloring |
22 | Shigenori Mochizuki, DongSheng Cai, T. Komiri, H. Kimura, R. Hori |
Virtual Autumn Coloring System Based on Biological and Fractal Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PG ![In: 9th Pacific Conference on Computer Graphics and Applications, PG 2001, Tokyo, Japan, October 16-18, 2001, pp. 348-354, 2001, IEEE Computer Society, 0-7695-1227-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
autumn coloring, chaos game algorithm, biological model, IFS |
22 | Venkatesan Guruswami, Johan Håstad, Madhu Sudan 0001 |
Hardness of Approximate Hypergraph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 149-158, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
approximate hypergraph coloring, covering complexity, probabilistic verifier, PCP verifier, 2-colorable 4-uniform hypergraph, hardness assumption, computational complexity, computational geometry, minimisation, graph colouring, hardness, minimization problems |
22 | Steven R. Vegdahl |
Using Node Merging to Enhance Graph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the 1999 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Atlanta, Georgia, USA, May 1-4, 1999, pp. 150-154, 1999, ACM, 1-58113-094-5. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
graph coloring, register allocation, register coalescing |
22 | Fadi Y. Busaba, Parag K. Lala |
A graph coloring based approach for self-checking logic circuit design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asian Test Symposium ![In: 4th Asian Test Symposium (ATS '95), November 23-24, 1995. Bangalore, India, pp. 327-, 1995, IEEE Computer Society, 0-8186-7129-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
logic circuit design, bidirectional error, residue weights assignments, output lines, errors identification, graph theory, logic testing, integrated circuit testing, logic design, error detection, error detection, automatic testing, graph coloring, fault location, integrated logic circuits, graph colouring, self-checking, residue codes, single stuck-at fault |
22 | Manoj Franklin, Kewal K. Saluja |
Hypergraph Coloring and Reconfigured RAM Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 43(6), pp. 725-736, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
hypergraph coloring, reconfigured RAM testing, RAM decoders, critical path lengths, memory chips, physical neighborhood pattern sensitive faults, reconfigured DRAMs, decoder faults, computational complexity, logic testing, redundancy, reconfigurable architectures, stuck-at faults, graph colouring, random-access storage, integrated memory circuits, test lengths, test algorithms, DRAM chips, silicon area |
22 | David R. Karger, Rajeev Motwani 0001, Madhu Sudan 0001 |
Approximate Graph Coloring by Semidefinite Programming ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 2-13, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
approximate graph coloring, k-colorable graphs, randomized polynomial time algorithm, semidefinite optimization problems, MAX 2-SAT problems, duality relationship, lower bounds, linear programs, semidefinite programming, vertices, chromatic number, MAX CUT, approximation ratio |
22 | Avrim Blum |
Some Tools for Approximate 3-Coloring (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume II, pp. 554-562, 1990, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
semirandom source, approximate 3-coloring, 3-chromatic graphs, noise rate, approximation algorithms, probability |
21 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001 |
Clique-width: on the price of generality. ![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. 825-834, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Christoph Dürr, Flavio Guiñez, Martín Matamala |
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, pp. 776-787, 2009, Springer, 978-3-642-04127-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi |
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I, pp. 316-327, 2009, Springer, 978-3-642-02926-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Noga Alon, Daniel Lokshtanov, Saket Saurabh 0001 |
Fast FAST. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I, pp. 49-58, 2009, Springer, 978-3-642-02926-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Petr A. Golovach, Pinar Heggernes |
Choosability of P5-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings, pp. 382-391, 2009, Springer, 978-3-642-03815-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Kun Yuan, Jae-Seok Yang, David Z. Pan |
Double patterning layout decomposition for simultaneous conflict and stitch minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPD ![In: Proceedings of the 2009 International Symposium on Physical Design, ISPD 2009, San Diego, California, USA, March 29 - April 1, 2009, pp. 107-114, 2009, ACM, 978-1-60558-449-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
double patterning lithography, layout decomposition, integer linear programming |
21 | Bas Schaafsma, Marijn Heule, Hans van Maaren |
Dynamic Symmetry Breaking by Simulating Zykov Contraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings, pp. 223-236, 2009, Springer, 978-3-642-02776-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Alexander Fanghänel, Thomas Kesselheim, Harald Räcke, Berthold Vöcking |
Oblivious interference scheduling. ![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. 220-229, 2009, ACM, 978-1-60558-396-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
scheduling, power control, interference, physical model, sinr |
21 | Ken-ichi Kawarabayashi, Bruce A. Reed |
Hadwiger's conjecture is decidable. ![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. 445-454, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Hadwiger's conjecture, the four color theorem |
21 | Madhur Tulsiani |
CSP gaps and reductions in the lasserre hierarchy. ![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. 303-312, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
constraint satisfaction, semidefinite programming, integrality gaps |
21 | Kun Yuan, Katrina Lu, David Z. Pan |
Double patterning lithography friendly detailed routing with redundant via consideration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 46th Design Automation Conference, DAC 2009, San Francisco, CA, USA, July 26-31, 2009, pp. 63-66, 2009, ACM, 978-1-60558-497-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
double patterning, redundant via, detailed routing |
21 | Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi |
Robust cost colorings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 1204-1212, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
21 | Oriana Ponta, Falk Hüffner, Rolf Niedermeier |
Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems. ![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. 490-501, 2008, Springer, 978-3-540-79227-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Rohit Ashok Khot, Ravikant Poola, Kishore Kothapalli, Kannan Srinathan |
Self-stabilizing Routing Algorithms for Wireless Ad-Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCIT ![In: Distributed Computing and Internet Technology, 4th International Conference, ICDCIT 2007, Bangalore, India, December 17-20, Proceedings, pp. 54-66, 2007, Springer, 978-3-540-77112-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Gábor Kun, Jaroslav Nesetril |
NP by Means of Lifts and Shadows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings, pp. 171-181, 2007, Springer, 978-3-540-74455-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
duality, Constraint Satisfaction Problem, homomorphism, Digraph, NP |
21 | Ralucca Gera |
On the Dominator Colorings in Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITNG ![In: Fourth International Conference on Information Technology: New Generations (ITNG 2007), 2-4 April 2007, Las Vegas, Nevada, USA, pp. 947-952, 2007, IEEE Computer Society, 978-0-7695-2776-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik |
Why Almost All k -Colorable Graphs Are Easy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings, pp. 121-132, 2007, Springer, 978-3-540-70917-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Philip Brisk, Foad Dabiri, Roozbeh Jafari, Majid Sarrafzadeh |
Optimal register sharing for high-level synthesis of SSA form programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25(5), pp. 772-779, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Shakhar Smorodinsky |
On the chromatic number of some geometric hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 316-323, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Robert Berke, Tibor Szabó |
Deciding Relaxed Two-Colorability - A Hardness Jump. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings, pp. 124-135, 2006, Springer, 3-540-38875-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | John Cavazos, J. Eliot B. Moss, Michael F. P. O'Boyle |
Hybrid Optimizations: Which Optimization Algorithm to Use?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CC ![In: Compiler Construction, 15th International Conference, CC 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 30-31, 2006, Proceedings, pp. 124-138, 2006, Springer, 3-540-33050-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Leiming Xu, Yong Xiang, Meilin Shi |
A novel channel assignment algorithm based on topology simplification in multi-radio wirelesss mesh networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCCC ![In: Proceedings of the 25th IEEE International Performance Computing and Communications Conference, IPCCC 2006, April 10-12, 2006, Phoenix, Arizona, USA, 2006, IEEE, 1-4244-0198-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Florent Bouchez, Alain Darte, Christophe Guillon, Fabrice Rastello |
Register Allocation: What Does the NP-Completeness Proof of Chaitin et al. Really Prove? Or Revisiting Register Allocation: Why and How. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCPC ![In: Languages and Compilers for Parallel Computing, 19th International Workshop, LCPC 2006, New Orleans, LA, USA, November 2-4, 2006. Revised Papers, pp. 283-298, 2006, Springer, 978-3-540-72520-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Hsu-Shen Lin, Chang-Biau Yang, Kuo-Tsung Tseng |
1-Fair Alternator Designs for the de Bruijn Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDCAT ![In: Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2006), 4-7 December 2006, Taipei, Taiwan, pp. 488-491, 2006, IEEE Computer Society, 0-7695-2736-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Gek Ling Chia, V. L. Chia |
On the Choice Numbers of Some Complete Multipartite Graphs. ![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. 30-37, 2005, Springer, 978-3-540-70665-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Dhruv Mubayi |
An Explicit Construction for a Ramsey Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 24(2), pp. 313-324, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C35, 05D10, 05C55 |
21 | Hans L. Bodlaender, Fedor V. Fomin |
Equitable Colorings of Bounded Treewidth Graphs. ![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. 180-190, 2004, Springer, 3-540-22823-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Haixia Jia, Cristopher Moore |
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2004, 10th International Conference, CP 2004, Toronto, Canada, September 27 - October 1, 2004, Proceedings, pp. 742-746, 2004, Springer, 3-540-23241-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Dae-Hwan Kim, Hyuk-Jae Lee |
Register Allocation Based on a Reference Flow Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APLAS ![In: Programming Languages and Systems, First Asian Symposium, APLAS 2003, Beijing, China, November 27-29, 2003, Proceedings, pp. 394-409, 2003, Springer, 3-540-20536-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Bernhard Scholz, Erik Eckstein |
Register allocation for irregular architectures. ![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. 139-148, 2002, ACM, 1-58113-527-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
boolean quadratic problem, register allocation |
21 | Alan A. Bertossi, Maria Cristina Pinotti, Richard B. Tan |
Channel Assignment with Separation for Special Classes of Wireless Networks: Grids and Rings. ![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 |
|
21 | Maria Axenovich, André Kündgen |
On a Generalized Anti-Ramsey Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 21(3), pp. 335-349, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 05C55, 05C35, 05D40 |
21 | Eldar Fischer |
Testing graphs for colorable properties. ![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. 873-882, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
21 | Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss |
Complexity Note on Mixed Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings, pp. 474-486, 2001, Springer, 3-540-42496-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela |
Approximating Call-Scheduling Makespan in All-Optical Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings, pp. 13-22, 2000, Springer, 3-540-41183-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Massimiliano Poletto, Vivek Sarkar |
Linear scan register allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 21(5), pp. 895-913, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
compilers, register allocation, code optimization |
21 | Shuji Isobe, Xiao Zhou 0001, Takao Nishizeki |
A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings, pp. 100-113, 1998, Springer, 3-540-65195-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
21 | Sajal K. Das 0001, Calvin Ching-Yuen Chen |
Efficient Parallel Algorithms on Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PARLE ![In: PARLE '92: Parallel Architectures and Languages Europe, 4th International PARLE Conference, Paris, France, June 15-18, 1992, Proceedings, pp. 131-143, 1992, Springer, 3-540-55599-4. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
21 | Ton Kloks, Hans L. Bodlaender |
Testing Superperfection of k-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '92, Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8-10, 1992, Proceedings, pp. 292-303, 1992, Springer, 3-540-55706-7. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
21 | Seiyang Yang, Maciej J. Ciesielski |
Optimum and suboptimum algorithms for input encoding and its relationship to logic minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 10(1), pp. 4-12, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
21 | Ravi B. Boppana, Magnús M. Halldórsson |
Approximating Maximum Independent Sets by Excluding Subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: SWAT 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 11-14, 1990, Proceedings, pp. 13-25, 1990, Springer, 3-540-52846-6. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
21 | David Bernstein, Dina Q. Goldin, Martin Charles Golumbic, Hugo Krawczyk, Yishay Mansour, Itai Nahshon, Ron Y. Pinter |
Spill Code Minimization Techniques for Optimizing Compilers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the ACM SIGPLAN'89 Conference on Programming Language Design and Implementation (PLDI), Portland, Oregon, USA, June 21-23, 1989, pp. 258-263, 1989, ACM, 0-89791-306-X. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
21 | Raphael A. Finkel |
Run-time Print Values. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGPLAN Notices ![In: ACM SIGPLAN Notices 18(2), pp. 62-64, 1983. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
21 | Manfred Jackel |
Context Senitive Formatting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGPLAN Notices ![In: ACM SIGPLAN Notices 18(2), pp. 65-68, 1983. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
19 | Nikolaos Fryganiotis, Symeon Papavassiliou, Christos Pelekis |
A note on the network coloring game: A randomized distributed (Δ + 1)-coloring algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 182, pp. 106385, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Miguel A. D. R. Palma, Isabel F. A. Gonçalves, Diana Sasaki, Simone Dantas |
On total coloring and equitable total coloring of infinite snark families. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RAIRO Oper. Res. ![In: RAIRO Oper. Res. 57(5), pp. 2619-2637, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Sarawute Sribunhung, Keaitsuda Nakprasit, Kittikorn Nakprasit, Pongpat Sittitrai |
Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 43(1), pp. 287-297, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Fernanda Couto, Diego Amaro Ferraz, Sulamita Klein |
New Results on Edge-coloring and Total-coloring of Split Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2303.05723, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | V. P. Abidha, Pradeesha Ashok, Avi Tomar, Dolly Yadav |
Coloring a Dominating Set Without Conflicts: q-Subset Square Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2303.06864, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman 0001 |
Dominator Coloring and CD Coloring in Almost Cluster Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures - 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings, pp. 106-119, 2023, Springer, 978-3-031-38905-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Nibedita Mandal, Pratima Panigrahi |
L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AKCE Int. J. Graphs Comb. ![In: AKCE Int. J. Graphs Comb. 19(2), pp. 133-140, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Janusz Dybizbanski |
Coloring Graphs in Oriented Coloring of Cubic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 38(5), pp. 147, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Jungho Ahn, Seonghyuk Im, Sang-il Oum |
The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2208.08330, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Xiaolan Hu, Jiaao Li |
Circular coloring and fractional coloring in planar graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 99(2), pp. 312-343, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Bardiya Aryanfard, Fahad Panolan |
Parameterized Complexity of List Coloring and Max Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications - 17th International Computer Science Symposium in Russia, CSR 2022, Virtual Event, June 29 - July 1, 2022, Proceedings, pp. 46-63, 2022, Springer, 978-3-031-09573-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Abidha V. P, Pradeesha Ashok, Avi Tomar, Dolly Yadav |
Coloring a Dominating Set Without Conflicts: q-Subset Square Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications - 17th International Computer Science Symposium in Russia, CSR 2022, Virtual Event, June 29 - July 1, 2022, Proceedings, pp. 17-34, 2022, Springer, 978-3-031-09573-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Zdenek Dvorák 0001, Daniel Král', Robin Thomas 0001 |
Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 150, pp. 244-269, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
19 | Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström |
Parameterized Pre-Coloring Extension and List Coloring Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 35(1), pp. 575-596, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
Displaying result #401 - #500 of 5849 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ 14][ >>] |
|