Online hypergraph coloring with rejection

[1] N. Alon, U. Arad, Y. Azar, Independent Sets in Hypergraphs with Applications to Routing Via Fixed Paths, Proc. 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX99), Lecture Notes in Computer Science1671 (1999) 16–27. ⇒810.1007/978-3-540-48413-4_3Search in Google Scholar

[2] A. Bar-Noy, P. Cheilaris and S. Smorodinsky, Conflict-free coloring for intervals: from offline to online, Proc. 18th Annual ACM Parallelism Algorithms Architectures (SPAA06), 2006, pp. 128–137. ⇒610.1145/1148109.1148133Search in Google Scholar

[3] A. Bar-Noy, P. Cheilaris, S. Olonetsky, and S. Smorodinsky, Online conflict-free colorings for hypergraphs, Proc. 34th International Colloquium on Automata, Languages and Programming (ICALP07), Lecture Notes in Computer Science4596 (2007) 219–230. ⇒610.1007/978-3-540-73420-8_21Search in Google Scholar

[4] A. Borodin, R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, 1998. ⇒6, 8Search in Google Scholar

[5] K. Chen, A. Fiat, H. Kaplan, M. Levy, J. Matousek, E. Mossel, J. Pach, M. Sharir, S. Smorodinsky, U. Wagner and E. Welzl, Online conflict-free coloring for intervals, SIAM J. Computing36 (2006) 1342–1359. ⇒610.1137/S0097539704446682Search in Google Scholar

[6] K. Chen, H. Kaplan, M. Sharir, Online CF coloring for halfplanes, congruent disks, and axis-parallel rectangles, ACM Trans. Algorithms5 (2009) Article No. 16. ⇒610.1145/1497290.1497292Search in Google Scholar

[7] L. Epstein, A. Levin, G. J. Woeginger, Graph coloring with rejection, J. Comput. System Sci., 77, 2 (2011) 439–447. ⇒610.1016/j.jcss.2010.06.016Search in Google Scholar

[8] M. M. Halldorsson, Online coloring of hypergraphs, Inform. Process. Lett.110, 10 (2010) 370–372. ⇒610.1016/j.ipl.2010.03.001Search in Google Scholar

[9] Cs. Imreh, J. Nagy-György, Online hypergraph coloring, Inform. Process. Lett.109, 4 (2008) 23–26. ⇒610.1016/j.ipl.2008.08.009Search in Google Scholar

[10] Cs. Imreh, Competitive analysis, in: Algorithms of Informatics, Vol. 1. Foundations (ed. A. Iványi), mondAt Kiadó, Budapest, 2007, pp. 395–428. ⇒6, 8Search in Google Scholar

[11] B. Keszegh, N. Lemons, D. Pálvölgyi, Online and quasi-online colorings of wedges and intervals, Proc. 39th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2013), Lecture Notes in Computer Science7741 (2013) 292–306. ⇒610.1007/978-3-642-35843-2_26Search in Google Scholar