Search results for "coloring"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
24	Benjamin Doerr	Balanced Coloring: Equally Easy for All Numbers of Colors?	STACS	2002	DBLP DOI BibTeX RDF
24	Subhash Khot	Hardness results for approximate hypergraph coloring.	STOC	2002	DBLP DOI BibTeX RDF
24	Uriel Feige, Eran Ofek, Udi Wieder	Approximating Maximum Edge Coloring in Multigraphs.	APPROX	2002	DBLP DOI BibTeX RDF
24	Hiroshi Tamura, Kaoru Watanabe, Masakazu Sengoku, Shoji Shinoda	On a new edge coloring related to multihop wireless networks.	APCCAS (2)	2002	DBLP DOI BibTeX RDF
24	Sven Oliver Krumke, Willem de Paepe, Jörg Rambau, Leen Stougie	Online Bin Coloring.	ESA	2001	DBLP DOI BibTeX RDF
24	Dimitris Fotakis 0001, Spiridon D. Likothanassis, Stamatis Stefanakos	An Evolutionary Annealing Approach to Graph Coloring.	EvoWorkshops	2001	DBLP DOI BibTeX RDF
24	Howard A. Peelle	Graph coloring in J: an introduction.	APL	2001	DBLP DOI BibTeX RDF	J
24	Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss	Coloring Mixed Hypertrees.	WG	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.	IFIP TCS	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.	SPAA	2000	DBLP DOI BibTeX RDF
24	Philip N. Klein, Hsueh-I Lu	Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs.	ISAAC	1998	DBLP DOI BibTeX RDF
24	A. E. Eiben, J. K. van der Hauw	Adaptive Penalties for Evolutionary Graph Coloring.	Artificial Evolution	1997	DBLP DOI BibTeX RDF
24	Pierre Kelsen	Neighborhood Graphs and Distributed Delta+1-Coloring.	SWAT	1996	DBLP DOI BibTeX RDF
24	Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan	Approximate Hypergraph Coloring.	SWAT	1996	DBLP DOI BibTeX RDF
24	Marina Papatriantafilou, Philippas Tsigas	How a Rainbow Coloring Function Can Simulate Wait-Free Handshaking.	MFCS	1994	DBLP DOI BibTeX RDF
24	Xiao Zhou 0001, Shin-Ichi Nakano, Takao Nishizeki	A Parallel Algorithm for Edge-Coloring Partial k-Trees.	SWAT	1994	DBLP DOI BibTeX RDF
24	Martin Fürer, C. R. Subramanian 0001, C. E. Veni Madhavan	Coloring Random Graphs in Polynomial Expected Time.	ISAAC	1993	DBLP DOI BibTeX RDF
24	Magnús M. Halldórsson, Mario Szegedy	Lower Bounds for On-Line Graph Coloring.	SODA	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.	WG	1991	DBLP DOI BibTeX RDF
24	Maciej Slusarek	A Coloring Algorithm for Interval Graphs.	MFCS	1989	DBLP DOI BibTeX RDF
24	Gregory J. Chaitin	Register Allocation & Spilling via Graph Coloring.	SIGPLAN Symposium on Compiler Construction	1982	DBLP DOI BibTeX RDF
24	Gregory J. Chaitin	Register allocation and spilling via graph coloring (with retrospective)	Best of PLDI	1982	DBLP DOI BibTeX RDF
22	Kai Hwang 0001, Deyi Li	Trusted Cloud Computing with Secure Resources and Data Coloring.	IEEE Internet Comput.	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.	ICDCS	2010	DBLP DOI BibTeX RDF	SINR Model, Distributed Algorithm, Coloring, Time Complexity, TDMA
22	Jue Xue	Graph Coloring.	Encyclopedia of Optimization	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.	HIS (1)	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.	PPoPP	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.	International Conference on Computational Science (3)	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.	J. Comb. Optim.	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.	Algorithmica	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.	Math. Program.	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.	Arch. Math. Log.	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.	Algorithmica	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.	CCS	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.	Graphs Comb.	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.	PG	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.	FOCS	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.	PLDI	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.	Asian Test Symposium	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.	IEEE Trans. Computers	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	FOCS	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)	FOCS	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.	SODA	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.	ESA	2009	DBLP DOI BibTeX RDF
21	Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi	Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs.	ICALP (1)	2009	DBLP DOI BibTeX RDF
21	Noga Alon, Daniel Lokshtanov, Saket Saurabh 0001	Fast FAST.	ICALP (1)	2009	DBLP DOI BibTeX RDF
21	Petr A. Golovach, Pinar Heggernes	Choosability of P5-Free Graphs.	MFCS	2009	DBLP DOI BibTeX RDF
21	Kun Yuan, Jae-Seok Yang, David Z. Pan	Double patterning layout decomposition for simultaneous conflict and stitch minimization.	ISPD	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.	SAT	2009	DBLP DOI BibTeX RDF
21	Alexander Fanghänel, Thomas Kesselheim, Harald Räcke, Berthold Vöcking	Oblivious interference scheduling.	PODC	2009	DBLP DOI BibTeX RDF	scheduling, power control, interference, physical model, sinr
21	Ken-ichi Kawarabayashi, Bruce A. Reed	Hadwiger's conjecture is decidable.	STOC	2009	DBLP DOI BibTeX RDF	Hadwiger's conjecture, the four color theorem
21	Madhur Tulsiani	CSP gaps and reductions in the lasserre hierarchy.	STOC	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.	DAC	2009	DBLP DOI BibTeX RDF	double patterning, redundant via, detailed routing
21	Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi	Robust cost colorings.	SODA	2008	DBLP BibTeX RDF
21	Oriana Ponta, Falk Hüffner, Rolf Niedermeier	Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems.	TAMC	2008	DBLP DOI BibTeX RDF
21	Rohit Ashok Khot, Ravikant Poola, Kishore Kothapalli, Kannan Srinathan	Self-stabilizing Routing Algorithms for Wireless Ad-Hoc Networks.	ICDCIT	2007	DBLP DOI BibTeX RDF
21	Gábor Kun, Jaroslav Nesetril	NP by Means of Lifts and Shadows.	MFCS	2007	DBLP DOI BibTeX RDF	duality, Constraint Satisfaction Problem, homomorphism, Digraph, NP
21	Ralucca Gera	On the Dominator Colorings in Bipartite Graphs.	ITNG	2007	DBLP DOI BibTeX RDF
21	Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik	Why Almost All k -Colorable Graphs Are Easy.	STACS	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.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2006	DBLP DOI BibTeX RDF
21	Shakhar Smorodinsky	On the chromatic number of some geometric hypergraphs.	SODA	2006	DBLP DOI BibTeX RDF
21	Robert Berke, Tibor Szabó	Deciding Relaxed Two-Colorability - A Hardness Jump.	ESA	2006	DBLP DOI BibTeX RDF
21	John Cavazos, J. Eliot B. Moss, Michael F. P. O'Boyle	Hybrid Optimizations: Which Optimization Algorithm to Use?.	CC	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.	IPCCC	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.	LCPC	2006	DBLP DOI BibTeX RDF
21	Hsu-Shen Lin, Chang-Biau Yang, Kuo-Tsung Tseng	1-Fair Alternator Designs for the de Bruijn Network.	PDCAT	2006	DBLP DOI BibTeX RDF
21	Gek Ling Chia, V. L. Chia	On the Choice Numbers of Some Complete Multipartite Graphs.	CJCDGCGT	2005	DBLP DOI BibTeX RDF
21	Dhruv Mubayi	An Explicit Construction for a Ramsey Problem.	Comb.	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.	MFCS	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.	CP	2004	DBLP DOI BibTeX RDF
21	Dae-Hwan Kim, Hyuk-Jae Lee	Register Allocation Based on a Reference Flow Analysis.	APLAS	2003	DBLP DOI BibTeX RDF
21	Bernhard Scholz, Erik Eckstein	Register allocation for irregular architectures.	LCTES-SCOPES	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.	IPDPS	2002	DBLP DOI BibTeX RDF
21	Maria Axenovich, André Kündgen	On a Generalized Anti-Ramsey Problem.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C55, 05C35, 05D40
21	Eldar Fischer	Testing graphs for colorable properties.	SODA	2001	DBLP BibTeX RDF
21	Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss	Complexity Note on Mixed Hypergraphs.	MFCS	2001	DBLP DOI BibTeX RDF
21	Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela	Approximating Call-Scheduling Makespan in All-Optical Networks.	WG	2000	DBLP DOI BibTeX RDF
21	Massimiliano Poletto, Vivek Sarkar	Linear scan register allocation.	ACM Trans. Program. Lang. Syst.	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.	WG	1998	DBLP DOI BibTeX RDF
21	Sajal K. Das 0001, Calvin Ching-Yuen Chen	Efficient Parallel Algorithms on Interval Graphs.	PARLE	1992	DBLP DOI BibTeX RDF
21	Ton Kloks, Hans L. Bodlaender	Testing Superperfection of k-Trees.	SWAT	1992	DBLP DOI BibTeX RDF
21	Seiyang Yang, Maciej J. Ciesielski	Optimum and suboptimum algorithms for input encoding and its relationship to logic minimization.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1991	DBLP DOI BibTeX RDF
21	Ravi B. Boppana, Magnús M. Halldórsson	Approximating Maximum Independent Sets by Excluding Subgraphs.	SWAT	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.	PLDI	1989	DBLP DOI BibTeX RDF
21	Raphael A. Finkel	Run-time Print Values.	ACM SIGPLAN Notices	1983	DBLP DOI BibTeX RDF
21	Manfred Jackel	Context Senitive Formatting.	ACM SIGPLAN Notices	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.	Inf. Process. Lett.	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.	RAIRO Oper. Res.	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.	Discuss. Math. Graph Theory	2023	DBLP DOI BibTeX RDF
19	Fernanda Couto, Diego Amaro Ferraz, Sulamita Klein	New Results on Edge-coloring and Total-coloring of Split Graphs.	CoRR	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.	CoRR	2023	DBLP DOI BibTeX RDF
19	Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman 0001	Dominator Coloring and CD Coloring in Almost Cluster Graphs.	WADS	2023	DBLP DOI BibTeX RDF
19	Nibedita Mandal, Pratima Panigrahi	L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs.	AKCE Int. J. Graphs Comb.	2022	DBLP DOI BibTeX RDF
19	Janusz Dybizbanski	Coloring Graphs in Oriented Coloring of Cubic Graphs.	Graphs Comb.	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.	CoRR	2022	DBLP DOI BibTeX RDF
19	Xiaolan Hu, Jiaao Li	Circular coloring and fractional coloring in planar graphs.	J. Graph Theory	2022	DBLP DOI BibTeX RDF
19	Bardiya Aryanfard, Fahad Panolan	Parameterized Complexity of List Coloring and Max Coloring.	CSR	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.	CSR	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.	J. Comb. Theory, Ser. B	2021	DBLP DOI BibTeX RDF
19	Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström	Parameterized Pre-Coloring Extension and List Coloring Problems.	SIAM J. Discret. Math.	2021	DBLP DOI BibTeX RDF