|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 8 occurrences of 8 keywords
|
|
|
Results
Found 28 publication records. Showing 28 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
94 | 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 |
59 | 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 |
|
22 | Marco Chiarandini, Irina Dumitrescu, Thomas Stützle |
Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Hybrid Metaheuristics ![In: Hybrid Metaheuristics, An Emerging Approach to Optimization, pp. 117-150, 2008, Springer, 978-3-540-78294-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Jaikumar Radhakrishnan, Aravind Srinivasan |
Improved Bounds and Algorithms for Hypergraph Two-Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 684-693, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Hypergraph coloring, The Probabilistic Method, Lovasz Local Lemma |
21 | Jirí Matousek 0001, Emo Welzl, Lorenz Wernisch |
Discrepancy and epsilon-approximations for bounded VC-dimension ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 424-430, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
geometric settings, in -approximations, bounded VC-dimension, two-coloring, m-point subset, upper bounds, discrepancy, polylogarithmic factors |
15 | Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur |
Testing Properties of Constraint-Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 13-16 June 2007, San Diego, California, USA, pp. 264-277, 2007, IEEE Computer Society, 0-7695-2780-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Jirí Matousek 0001 |
On the Signed Domination in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 20(1), pp. 103-108, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C78, 05D15 |
13 | Jaikumar Radhakrishnan, Aravind Srinivasan |
Property B: Two-Coloring Non-Uniform Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference., pp. 31:1-31:8, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-215-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Balázs Keszegh |
Two-Coloring Triples such that in Each Color Class Every Element is Missed at Least Once. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 36(6), pp. 1783-1795, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Zdenek Dvorák 0001, Adam Kabela, Tomás Kaiser |
Planar graphs have two-coloring number at most 8. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 130, pp. 144-157, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Tomás Feder, Pavol Hell, Carlos S. Subi |
Distance-Two Coloring of Barnette Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCCG ![In: Proceedings of the 30th Canadian Conference on Computational Geometry, CCCG 2018, August 8-10, 2018, University of Manitoba, Winnipeg, Manitoba, Canada, pp. 304-310, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Yaroslav Shitov |
A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 674, pp. 116-118, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Zhe Han, Mei Lu |
Two coloring problems on matrix graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Algorithms Appl. ![In: Discret. Math. Algorithms Appl. 8(3), pp. 1650053:1-1650053:9, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Jaikumar Radhakrishnan, Saswata Shannigrahi, Rakesh Venkat |
Hypergraph Two-Coloring in the Streaming Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1512.04188, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
13 | Zdenek Dvorák 0001, Louis Esperet |
Distance-two coloring of sparse graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 36, pp. 406-415, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
13 | Bernard Ries |
Complexity of two coloring problems in cubic planar bipartite mixed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 158(5), pp. 592-596, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
13 | Hal A. Kierstead, Bojan Mohar, Simon Spacapan, Daqing Yang, Xuding Zhu |
The Two-Coloring Number and Degenerate Colorings of Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 23(3), pp. 1548-1560, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
13 | Bernard Ries, Dominique de Werra |
On two coloring problems in mixed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 29(3), pp. 712-725, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
13 | Robert Berke, Tibor Szabó |
Relaxed two-coloring of cubic graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 97(4), pp. 652-668, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
13 | Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali |
Two-coloring random hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 20(2), pp. 249-259, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
13 | Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali |
Two-coloring Random Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP Satellite Workshops ![In: ICALP Workshops 2000, Proceedings of the Satelite Workshops of the 27th International Colloquium on Automata, Languages and Programming, Geneva, Switzerland, July 9-15, 2000, pp. 85-96, 2000, Carleton Scientific, Waterloo, Ontario, Canada, 1-894145-07-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
13 | Carsten Thomassen |
Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 75(1), pp. 100-109, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
13 | Sanjeev Saxena |
Two-Coloring Linked Lists is NC^1-Complete for Logarithmic Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 49(2), pp. 73-76, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
13 | Michael Reid, Douglas S. Jungreis, Dave Witte |
Distances forbidden by some two-coloring of Q2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 82(1), pp. 53-56, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
13 | George B. Purdy, John E. Wetzel |
Two-coloring inequalities for Euclidean arrangements in general position. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 31(1), pp. 53-58, 1980. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
8 | Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Huijuan Wang, Alexander Zelikovsky |
Optimal phase conflict removal for layout of dark field alternatingphase shifting masks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 19(2), pp. 175-187, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
8 | Ping Gong 0004, Daoyun Xu |
A New Lower Bound of Critical Function for (k, s)-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings, pp. 274-282, 2006, Springer, 3-540-34021-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
8 | Gyula Károlyi, János Pach, Géza Tóth 0001, Pavel Valtr 0001 |
Ramsey-Type Results for Geometric Graphs, II. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 20(3), pp. 375-388, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #28 of 28 (100 per page; Change: )
|
|