Search results for "Coloring"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
124	Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman 0001	Approximating interval coloring and max-coloring in chordal graphs.	ACM J. Exp. Algorithmics	2005	DBLP DOI BibTeX RDF	Graph coloring, chordal graphs, dynamic storage allocation, perfect graphs
108	Guillaume Fertin, André Raspaud, Bruce A. Reed	On Star Coloring of Graphs.	WG	2001	DBLP DOI BibTeX RDF	proper coloring, star coloring, acyclic coloring, graphs, treewidth, vertex coloring
93	Sariel Har-Peled, Shakhar Smorodinsky	On conflict-free coloring of points and simple regions in the plane.	SCG	2003	DBLP DOI BibTeX RDF	coloring, cellular network, frequency assignment
91	Leonid Barenboim, Michael Elkin	Distributed (delta+1)-coloring in linear (in delta) time.	STOC	2009	DBLP DOI BibTeX RDF	defective-coloring, distributed algorithms, coloring
88	Sriram V. Pemmaraju, Aravind Srinivasan	The Randomized Coloring Procedure with Symmetry-Breaking.	ICALP (1)	2008	DBLP DOI BibTeX RDF
88	Sriram V. Pemmaraju, Rajiv Raman 0001	Approximation Algorithms for the Max-coloring Problem.	ICALP	2005	DBLP DOI BibTeX RDF
81	Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Alfredo Navarra	On the Complexity of Distributed Greedy Coloring.	DISC	2007	DBLP DOI BibTeX RDF
81	Kishore Kothapalli, Christian Scheideler, Melih Onus, Christian Schindelhauer	Distributed coloring in O~(⎷(log n)) bit rounds.	IPDPS	2006	DBLP DOI BibTeX RDF
79	Xuejun Yang, Yu Deng 0001, Li Wang 0027, Xiaobo Yan, Jing Du 0002, Ying Zhang 0032, Guibin Wang, Tao Tang 0001	SRF Coloring: Stream Register File Allocation via Graph Coloring.	J. Comput. Sci. Technol.	2009	DBLP DOI BibTeX RDF	SRF coloring, stream register file, memory management, compiler optimization, graph coloring, stream processor
79	Xiao Zhou 0001, Yuki Matsuo, Takao Nishizeki	List Total Colorings of Series-Parallel Graphs.	COCOON	2003	DBLP DOI BibTeX RDF
77	Rei Odaira, Takuya Nakaike, Tatsushi Inagaki, Hideaki Komatsu, Toshio Nakatani	Coloring-based coalescing for graph coloring register allocation.	CGO	2010	DBLP DOI BibTeX RDF	register allocation, register coalescing
77	Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman 0001	Approximating Interval Coloring and Max-Coloring in Chordal Graphs.	WEA	2004	DBLP DOI BibTeX RDF
76	Ken-ichi Kawarabayashi, Bojan Mohar	List-color-critical graphs on a fixed surface.	SODA	2009	DBLP DOI BibTeX RDF	critical graphs, surface, list-coloring
72	Jian Ni, R. Srikant 0001, Xinzhou Wu	Coloring spatial point processes with applications to peer discovery in large wireless networks.	SIGMETRICS	2010	DBLP DOI BibTeX RDF	coloring algorithms, spatial point processes, wireless networks, channel assignment
72	Xiao Zhang, Sandhya Dwarkadas, Kai Shen	Towards practical page coloring-based multicore cache management.	EuroSys	2009	DBLP DOI BibTeX RDF	page coloring, resource management, multi-core, cache partitioning
72	Fabian Kuhn, Roger Wattenhofer	On the complexity of distributed graph coloring.	PODC	2006	DBLP DOI BibTeX RDF	distributed algorithms, locality, graph coloring, chromatic number, symmetry breaking, neighborhood graph
71	Andreas Brandstädt, Feodor F. Dragan, Yang Xiang, Chenyu Yan	Generalized Powers of Graphs and Their Algorithmic Use.	SWAT	2006	DBLP DOI BibTeX RDF
69	Haytham Elghazel, Tetsuya Yoshida, Véronique Deslandres, Mohand-Said Hacid, Alain Dussauchoy	A New Greedy Algorithm for Improving b-Coloring Clustering.	GbRPR	2007	DBLP DOI BibTeX RDF	graph b-coloring, graph re-coloring, clustering
69	Rajiv Gandhi, Bradford Greening, Sriram V. Pemmaraju, Rajiv Raman 0001	Sub-coloring and Hypo-coloring Interval Graphs.	WG	2009	DBLP DOI BibTeX RDF
67	Hal A. Kierstead, Daqing Yang	Very Asymmetric Marking Games.	Order	2005	DBLP DOI BibTeX RDF	coloring number, competitive coloring, planar graph
67	Uriel Feige, Mohit Singh	Edge Coloring and Decompositions of Weighted Graphs.	ESA	2008	DBLP DOI BibTeX RDF
65	Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos	Probabilistic graph-coloring in bipartite and split graphs.	J. Comb. Optim.	2009	DBLP DOI BibTeX RDF	Probabilistic optimization, Approximation algorithms, Graph coloring
65	Kyriaki Ioannidou, Stavros D. Nikolopoulos	Colinear Coloring on Graphs.	WALCOM	2009	DBLP DOI BibTeX RDF	Colinear coloring, threshold graphs, quasi-threshold graphs, algorithms, complexity, chordal graphs, chromatic number
65	Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma	Three Complexity Results on Coloring Pk-Free Graphs.	IWOCA	2009	DBLP DOI BibTeX RDF	P k -free graph, computational complexity, graph coloring
65	Peter Damaschke	Distributed Soft Path Coloring.	STACS	2003	DBLP DOI BibTeX RDF	distributed algorithms, locality, randomization, coloring
64	Guy Even, Zvi Lotker, Dana Ron, Shakhar Smorodinsky	Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks.	FOCS	2002	DBLP DOI BibTeX RDF
62	Ke Chen 0006, Haim Kaplan, Micha Sharir	Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles.	ACM Trans. Algorithms	2009	DBLP DOI BibTeX RDF	Conflict free coloring, online algorithms, coloring
62	Jihui Wang, Sumei Zhang, Jianfeng Hou	On f -Edge Cover-Coloring of Simple Graphs.	International Conference on Computational Science (3)	2007	DBLP DOI BibTeX RDF	Simple graph, f-edge cover-coloring, Edge-coloring
62	Fabian Kuhn	Weak graph colorings: distributed algorithms and applications.	SPAA	2009	DBLP DOI BibTeX RDF	deterministic symmetry breaking, distributed algorithms, locality, graph coloring
60	Thang Nguyen Bui, ThanhVu H. Nguyen	An agent-based algorithm for generalized graph colorings.	GECCO	2006	DBLP DOI BibTeX RDF	bandwidth coloring, bandwidth multicoloring, graph coloring, multicoloring
60	Telikepalli Kavitha, Julián Mestre	Max-Coloring Paths: Tight Bounds and Extensions.	ISAAC	2009	DBLP DOI BibTeX RDF
60	Jing Liu 0006, Weicai Zhong, Jinshu Li	Multiagent Evolutionary Algorithm for T-coloring Problem.	SEAL	2008	DBLP DOI BibTeX RDF
60	Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir	Connected Coloring Completion for General Graphs: Algorithms and Complexity.	COCOON	2007	DBLP DOI BibTeX RDF	Topics Algorithms and Complexity, Bioinformatics
60	Chun-Chen Hsu, Pangfeng Liu, Da-Wei Wang 0004, Jan-Jan Wu	Generalized Edge Coloring for Channel Assignment in Wireless Networks.	ICPP	2006	DBLP DOI BibTeX RDF
60	Sriram V. Pemmaraju, Rajiv Raman 0001, Kasturi R. Varadarajan	Buffer minimization using max-coloring.	SODA	2004	DBLP BibTeX RDF
58	Gary Lewandowski, Anne Condon	Experiments with parallel graph coloring heuristics and applications of graph coloring.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF
57	Leonid Barenboim, Michael Elkin	Deterministic distributed vertex coloring in polylogarithmic time.	PODC	2010	DBLP DOI BibTeX RDF	arbdefective-coloring, arboricity, partial-orientation
57	Jean Cardinal, Samuel Fiorini, Gwenaël Joret	Minimum entropy coloring.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Complexity, Entropy, Graph coloring
57	Lyes Dekar, Hamamache Kheddouci	Distance-2 Self-stabilizing Algorithm for a b-Coloring of Graphs.	SSS	2008	DBLP DOI BibTeX RDF	b-coloring, data mining, clustering, graphs, self-stabilizing algorithm
57	Mathieu Couture, Michel Barbeau, Prosenjit Bose, Paz Carmi, Evangelos Kranakis	Location Oblivious Distributed Unit Disk Graph Coloring.	SIROCCO	2007	DBLP DOI BibTeX RDF	location oblivious algorithms, approximation algorithms, distributed algorithms, coloring, unit disk graph
57	Benjamin Doerr	Structured Randomized Rounding and Coloring.	FCT	2001	DBLP DOI BibTeX RDF	hypergraph coloring, randomized algorithms, integer linear programming, discrepancy, randomized rounding
57	Nobuo Tsuda	Fault-Tolerant Processor Arrays Using Additional Bypass Linking Allocated by Graph-Node Coloring.	IEEE Trans. Computers	2000	DBLP DOI BibTeX RDF	k-out-of-n redundancy, additional bypass linking, graph-node coloring, enhanced communication and broadcast, fault tolerance, tree, mesh, Processor array
57	Preston Briggs, Keith D. Cooper, Linda Torczon	Improvements to Graph Coloring Register Allocation.	ACM Trans. Program. Lang. Syst.	1994	DBLP DOI BibTeX RDF	code generation, graph coloring, register allocation
57	Shlomo Moran, Sagi Snir	Efficient Approximation of Convex Recolorings.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
53	Daniel Kobler, Udi Rotics	Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract).	SODA	2001	DBLP BibTeX RDF	coloring, dominating set, polynomial algorithms, edge-coloring, clique-width, edge-dominating set
53	Zdenek Dvorák 0001, Daniel Král, Robin Thomas 0001	Coloring triangle-free graphs on surfaces.	SODA	2009	DBLP DOI BibTeX RDF
53	Magnús M. Halldórsson, Hadas Shachnai	Batch Coloring Flat Graphs and Thin.	SWAT	2008	DBLP DOI BibTeX RDF
53	Steffen Mecke	MAC Layer and Coloring.	Algorithms for Sensor and Ad Hoc Networks	2007	DBLP DOI BibTeX RDF
53	Leah Epstein, Meital Levy	Online Interval Coloring with Packing Constraints.	MFCS	2005	DBLP DOI BibTeX RDF
53	Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos	Probabilistic Coloring of Bipartite and Split Graphs.	ICCSA (4)	2005	DBLP DOI BibTeX RDF
53	Gianluca De Marco, Andrzej Pelc	Fast distributed graph coloring with O(Delta) colors.	SODA	2001	DBLP BibTeX RDF
50	Johannes Schneider 0002, Roger Wattenhofer	Coloring unstructured wireless multi-hop networks.	PODC	2009	DBLP DOI BibTeX RDF	bounded independence graphs, growth bounded graphs, unstructured radio networks, sensor networks, parallel algorithms, ad hoc networks, distributed algorithms, coloring, local algorithms, unit disk graphs
50	A. N. Trahtman	Synchronizing Road Coloring.	IFIP TCS	2008	DBLP DOI BibTeX RDF	road coloring problem, synchronization, graph, deterministic finite automaton
50	Ke Chen 0006	How to play a coloring game against a color-blind adversary.	SCG	2006	DBLP DOI BibTeX RDF	conflict-free coloring, online algorithm
50	Xujin Chen, Zhiquan Hu, Wenan Zang	Perfect Circular Arc Coloring.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	complexity, matching, graph coloring, perfect graph, circular-arc graph
50	Michael D. Smith 0001, Norman Ramsey, Glenn H. Holloway	A generalized algorithm for graph-coloring register allocation.	PLDI	2004	DBLP DOI BibTeX RDF	graph coloring, register allocation
50	Akira Koseki, Hideaki Komatsu, Toshio Nakatani	Preference-Directed Graph Coloring.	PLDI	2002	DBLP DOI BibTeX RDF	irregular-register architectures, graph coloring, register allocation, register coalescing
50	Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger	Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous.	SWAT	2002	DBLP DOI BibTeX RDF	computational complexity, graph coloring, planar graph, graph partitioning, forbidden subgraph
50	Robert Freimer	Generalized map coloring for use in geographical information systems.	ACM-GIS	2000	DBLP DOI BibTeX RDF	Dsatur heuristic, Heawood's m-pire problem, cartographic maps, GIS, coloring, map graphs
50	Avrim Blum	New Approximation Algorithms for Graph Coloring.	J. ACM	1994	DBLP DOI BibTeX RDF	approximation algorithms, graph coloring, chromatic number
48	Lian Li 0002, Hui Feng, Jingling Xue	Compiler-directed scratchpad memory management via graph coloring.	ACM Trans. Archit. Code Optim.	2009	DBLP DOI BibTeX RDF	live range splitting, memory coloring, graph coloring, memory allocation, Scratchpad memory, register coalescing, software-managed cache
48	Benedito J. B. Fonseca Jr.	An augmented graph-based coloring scheme to derive upper bounds for the performance of distributed schedulers in CSMA-based mobile ad hoc networks.	IWCMC	2006	DBLP DOI BibTeX RDF	coloring schemes, graph-based coloring schemes, performance upper bound, mobile ad hoc networks, graph theory, 802.11, scheduling algorithms, CSMA
48	Kazunori Mizuno, Seiichi Nishihara	Local minimum structures of graph-coloring problems for stochastic constraint satisfaction algorithms.	ICTAI	2000	DBLP DOI BibTeX RDF	local minimum structures, stochastic constraint satisfaction, stochastic search algorithms, large-scale constraint satisfaction problems, locally minimal solutions, local constraint structures, LM pair, stochastic programming, operations research, graph colouring, hill-climbing, stepwise refinement, local minima, constraint theory, graph-coloring problems, graph-coloring problem
48	Edward C. Sewell	An improved algorithm for exact graph coloring.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF
48	Fred W. Glover, Mark Parker, Jennifer Ryan	Coloring by tabu branch and bound.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF
48	Charles Fleurent, Jacques A. Ferland	Object-oriented implementation of heuristic search methods for Graph Coloring, Maximum Clique, and Satisfiability.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF
48	David S. Johnson, Michael A. Trick	Foreword xiIntroduction to the Second DIMACS Challenge: Cliques, coloring, and satisfiability.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF
46	Richard Beigel, David Eppstein	3-Coloring in Time O(1.3446n): A No-MIS Algorithm.	FOCS	1995	DBLP DOI BibTeX RDF	duality (mathematics), 3-coloring, worst case time bounds, 3-edge-coloring, 3-list-coloring, common generalization, symbol-system satisfiability, duality transformation, computational complexity, computability, decidability, NP-complete problems, graph colouring, time bounds, 3-SAT
46	Andrea Vietri	Arc-Coloring of Directed Hypergraphs and Brick-Coloring of Walls.	IV	2004	DBLP DOI BibTeX RDF	arc-coloring, brick, chromatic index, directed hypergraph, wall
45	Alan A. Bertossi, Maria Cristina Pinotti, Richard B. Tan	Channel Assignment with Separation for Interference Avoidance in Wireless Networks.	IEEE Trans. Parallel Distributed Syst.	2003	DBLP DOI BibTeX RDF	cellular grids, bidimensional grids, L(2,1,1){hbox{-}}rm coloring, L(delta_1,1,ldots,1){hbox{-}}rm coloring, Wireless networks, interferences, channel assignment, rings
45	Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann	Deconstructing Intractability: A Case Study for Interval Constrained Coloring.	CPM	2009	DBLP DOI BibTeX RDF
45	Xuxian Jiang, Florian P. Buchholz, Aaron Walters, Dongyan Xu, Yi-Min Wang, Eugene H. Spafford	Tracing Worm Break-In and Contaminations via Process Coloring: A Provenance-Preserving Approach.	IEEE Trans. Parallel Distributed Syst.	2008	DBLP DOI BibTeX RDF	(viruses, worms, Trojan horses), Servers, Security and Protection
45	Panagiota N. Panagopoulou, Paul G. Spirakis	A Game Theoretic Approach for Efficient Graph Coloring.	ISAAC	2008	DBLP DOI BibTeX RDF
45	Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, Rodica Mihai	Comparing First-Fit and Next-Fit for Online Edge Coloring.	ISAAC	2008	DBLP DOI BibTeX RDF
45	Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi	"Rent-or-Buy" Scheduling and Cost Coloring Problems.	FSTTCS	2007	DBLP DOI BibTeX RDF
45	Jean Cardinal, Samuel Fiorini, Gwenaël Joret	Minimum Entropy Coloring.	ISAAC	2005	DBLP DOI BibTeX RDF
45	Guizhen Liu, Changqing Xu	Some Topics on Edge-Coloring.	CJCDGCGT	2005	DBLP DOI BibTeX RDF
45	Leah Epstein, Meital Levy	Online Interval Coloring and Variants.	ICALP	2005	DBLP DOI BibTeX RDF
45	Ioannis Caragiannis, Christos Kaklamanis	Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks.	STACS	2004	DBLP DOI BibTeX RDF
45	Ying Kong, Fan Wang 0003, Andrew Lim 0001, Songshan Guo	A New Hybrid Genetic Algorithm for the Robust Graph Coloring Problem.	Australian Conference on Artificial Intelligence	2003	DBLP DOI BibTeX RDF
45	Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos	The Complexity of Restrictive H-Coloring.	WG	2002	DBLP DOI BibTeX RDF
45	Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos	Weighted Node Coloring: When Stable Sets Are Expensive.	WG	2002	DBLP DOI BibTeX RDF
45	C. R. Subramanian 0001	Coloring Sparse Random Graphs in Polynominal Average Time.	ESA	2000	DBLP DOI BibTeX RDF
45	Keith D. Cooper, L. Taylor Simpson	Live Range Splitting in a Graph Coloring Register Allocator.	CC	1998	DBLP DOI BibTeX RDF
45	Shin-Ichi Nakano, Xiao Zhou 0001, Takao Nishizeki	Edge-Coloring Algorithms.	Computer Science Today	1995	DBLP DOI BibTeX RDF
45	Fred C. Chow, John L. Hennessy	The Priority-Based Coloring Approach to Register Allocation.	ACM Trans. Program. Lang. Syst.	1990	DBLP DOI BibTeX RDF
43	Dhia Mahjoub, David W. Matula	Experimental Study of Independent and Dominating Sets in Wireless Sensor Networks Using Graph Coloring Algorithms.	WASA	2009	DBLP DOI BibTeX RDF	domatic partition problem, triangular lattice, Wireless Sensor Networks, graph coloring, dominating sets, independent sets, random geometric graphs
43	Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky	Deterministic conflict-free coloring for intervals: From offline to online.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	Online algorithms, coloring, cellular networks, frequency assignment, conflict free
43	Richard Cole 0001, Lukasz Kowalik	New Linear-Time Algorithms for Edge-Coloring Planar Graphs.	Algorithmica	2008	DBLP DOI BibTeX RDF	Algorithm, Planar graph, Edge-coloring, Linear-time
43	Pawel B. Myszkowski	Solving Scheduling Problems by Evolutionary Algorithms for Graph Coloring Problem.	Metaheuristics for Scheduling in Industrial and Manufacturing Applications	2008	DBLP DOI BibTeX RDF	Evolutionary Algorithms, Graph Coloring, Multiprocessor scheduling, Assignment Problems, Timetabling, Genetic Operators
43	Frank Kammer, Torsten Tholey	The Complexity of Minimum Convex Coloring.	ISAAC	2008	DBLP DOI BibTeX RDF	Convex Coloring, Maximum Disjoint Paths Problem
43	Jirí Fiala 0001, Petr A. Golovach	Complexity of the Packing Coloring Problem for Trees.	WG	2008	DBLP DOI BibTeX RDF	Packing coloring, computational complexity, graph algorithm, chordal graph
43	Sanjukta Bhowmick, Paul D. Hovland	Improving the Performance of Graph Coloring Algorithms through Backtracking.	ICCS (1)	2008	DBLP DOI BibTeX RDF	Graph Coloring, Backtracking
43	Chang-Wu Yu 0001	On the Complexity of the Max-Edge-Coloring Problem with Its Variants.	ESCAPE	2007	DBLP DOI BibTeX RDF	multi-graphs, bipartite graphs, algorithm design, edge coloring
43	Alexa Sharp	Distance Coloring.	ESA	2007	DBLP DOI BibTeX RDF	power graphs, complexity threshold, Graph coloring
43	Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger	Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult.	Algorithmica	2006	DBLP DOI BibTeX RDF	Computational complexity, Graph coloring, Planar graph, Graph partitioning, Forbidden subgraph
43	Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky	Conflict-free coloring for intervals: from offline to online.	SPAA	2006	DBLP DOI BibTeX RDF	online algorithms, coloring, cellular networks, frequency assignment, conflict free
43	Jinhyuk Choi, Geehyuk Lee	The Bifurcating Neuron Network 3 as Coloring Problem Solver and N-Ary Associative Memory.	ICONIP (1)	2006	DBLP DOI BibTeX RDF	bifurcating neuron, bifurcating neuron network, coloring problem, associative memory, pulse-coupled neural network
43	Tínaz Ekim, Dominique de Werra	On Split-Coloring Problems.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	split-coloring, vertex covering by split graphs, partitioning, packing
43	Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos	Weighted Coloring: Further Complexity and Approximability Results.	ICTCS	2005	DBLP DOI BibTeX RDF	weighted coloring, line graph of bipartite graphs, Approximation algorithm, NP-complete problems, interval graphs, partial k-tree