Go to the corresponding LIPIcs Volume Portal 
Fekete, Sándor P. ; Keldenich, Phillip
pdfformat: 

@InProceedings{fekete_et_al:LIPIcs:2017:8216, author = {S{\'a}ndor P. Fekete and Phillip Keldenich}, title = {{ConflictFree Coloring of Intersection Graphs}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {31:131:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770545}, ISSN = {18688969}, year = {2017}, volume = {92}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/8216}, URN = {urn:nbn:de:0030drops82162}, doi = {10.4230/LIPIcs.ISAAC.2017.31}, annote = {Keywords: conflictfree coloring, intersection graphs, unit disk graphs, complexity, worstcase bounds} }
Keywords:  conflictfree coloring, intersection graphs, unit disk graphs, complexity, worstcase bounds  
Seminar:  28th International Symposium on Algorithms and Computation (ISAAC 2017)  
Issue Date:  2017  
Date of publication:  04.12.2017 