Search results for "coloring"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
14	Mayez A. Al-Mouhamed, Steven S. Seiden	A Heuristic Storage for Minimizing Access Time of Arbitrary Data Patterns.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	Boolean matrices, performance evaluation, heuristics, NP-complete, memory organization, storage schemes, parallel memories
14	Klaus Jansen	Approximation Results for the Optimum Cost Partition Problem.	ICALP	1997	DBLP DOI BibTeX RDF
14	Mikkel Thorup	Structured Programs have Small Tree-Width and Good Register Allocation (Extended Abstract).	WG	1997	DBLP DOI BibTeX RDF
14	Klaus Jansen	The Optimum Cost Chromatic Partition Problem.	CIAC	1997	DBLP DOI BibTeX RDF
14	Wen-Jiin Tsai, Suh-Yin Lee	Real-Time Scheduling of Multimedia Data Retrieval to Minimize Buffer Requirements.	ACM SIGOPS Oper. Syst. Rev.	1996	DBLP DOI BibTeX RDF
14	Kent Cantwell	Edge-Ramsey Theory.	Discret. Comput. Geom.	1996	DBLP DOI BibTeX RDF
14	Andreas Nolte, Rainer Schrader	Simulated Annealing and Its Problems to Color Graphs.	ESA	1996	DBLP DOI BibTeX RDF
14	Jordan Gergov	Approximation Algorithms for Dynamic Storage Allocations.	ESA	1996	DBLP DOI BibTeX RDF
14	D. L. Springer, Donald E. Thomas	Exploiting the special structure of conflict and compatibility graphs in high-level synthesis.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1994	DBLP DOI BibTeX RDF
14	Shun-Shii Lin	Constant-time algorithms for the channel assignment problem on processor arrays with reconfigurable bus systems.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1994	DBLP DOI BibTeX RDF
14	Jun Dong Cho, Salil Raje, Majid Sarrafzadeh	Approximation Algorithm on Multi-Way Maxcut Partitioning.	ESA	1994	DBLP DOI BibTeX RDF
14	Ton Kloks, Hans L. Bodlaender	Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs.	ISAAC	1992	DBLP DOI BibTeX RDF
14	Goos Kant, Jan van Leeuwen	The File Distribution Problem for Processor Networks.	SWAT	1990	DBLP DOI BibTeX RDF
14	Rong Lin, Stephan Olariu	Fast Parallel Algorithms for Cographs.	FSTTCS	1990	DBLP DOI BibTeX RDF
14	Peter Steenkiste, John L. Hennessy	A Simple Interprocedural Register Allocation Algorithm and Its Effectiveness for Lisp.	ACM Trans. Program. Lang. Syst.	1989	DBLP DOI BibTeX RDF	LISP
14	Wolfgang Gutjahr, Emo Welzl, Gerhard J. Woeginger	Polynomial Graph-Colorings.	STACS	1989	DBLP DOI BibTeX RDF
14	Rasiah Loganantharaj, Robert A. Mueller	Parallel Theorem Proving with Connection Graphs.	CADE	1986	DBLP DOI BibTeX RDF
12	Mohammad Sayad Haghighi, Kamal Mohamedpour, Vijay Varadharajan, Alireza Mohammadi-Nodooshan	Overhearing Gain Analysis in Low-Traffic CDMA Wireless Sensor Networks.	SUTC/UMC	2010	DBLP DOI BibTeX RDF	Overhearing/Eavesdropping, CDMA (Code Division Multiple Access), Sensor Networks, Graph Coloring
12	Toshimitsu Masuzawa, Sébastien Tixeuil	Stabilizing Locally Maximizable Tasks in Unidirectional Networks Is Hard.	ICDCS	2010	DBLP DOI BibTeX RDF	Distribtued algorithms, grundy coloring, unidirectionnal networks, self-stabilization, maximal independent set, maximal matching
12	Brandon Lucia, Luis Ceze, Karin Strauss	ColorSafe: architectural support for debugging and dynamically avoiding multi-variable atomicity violations.	ISCA	2010	DBLP DOI BibTeX RDF	bug avoidance, concurrency errors, data coloring, multi-variable, debugging, atomicity violations
12	Balabhaskar Balasundaram, Sergiy Butenko	Optimization Problems in Unit-Disk Graphs.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Approximation algorithms, Coloring, Dominating sets, Independent sets, PTAS, Cliques, Unit-disk graphs
12	Robert Murphey	Frequency Assignment Problem.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Optimization, Graph coloring
12	David Eppstein	Testing bipartiteness of geometric intersection graphs.	ACM Trans. Algorithms	2009	DBLP DOI BibTeX RDF	Hopcroft's problem, coin graph, geometric thickness, graph coloring, minimum spanning tree, Bipartite graph, line segments, disks, intersection graph
12	Fedor V. Fomin, Serge Gaspers, Saket Saurabh 0001, Alexey A. Stepanov	On Two Techniques of Combining Branching and Treewidth.	Algorithmica	2009	DBLP DOI BibTeX RDF	Exact exponential time algorithms, #3-Coloring, #Minimum dominating set, Minimum maximal matching, k-Weighted vertex cover, NP hard problems, Treewidth, Parameterized algorithms
12	Hayri Ardal, Ján Manuch, Moshe Rosenfeld 0001, Saharon Shelah, Ladislav Stacho	The Odd-Distance Plane Graph.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	The unit-distance graph, List-chromatic number (choosability), Graph coloring
12	Arturo Carpi, Flavio D'Alessandro	The Synchronization Problem for Locally Strongly Transitive Automata.	MFCS	2009	DBLP DOI BibTeX RDF	?erný conjecture, road coloring problem, synchronizing automaton, rational series
12	Hakun Lee, Keiichi Kaneko	Two New Algorithms for Software Watermarking by Register Allocation and their Empirical Evaluation.	ITNG	2009	DBLP DOI BibTeX RDF	static watermarking, graph coloring, software protection, software piracy, interference graph
12	Robin Stewart, m. c. schraefel	Graph sketcher: extending illustration to quantitative graphs.	CHI	2009	DBLP DOI BibTeX RDF	constraint-based layout, planar map coloring, quantitative concept diagrams, snap-dragging, information visualization, illustration, charting
12	Baoyindureng Wu, Xinhui An	A Note on Edge Choosability and Degeneracy of Planar Graphs.	COCOA	2009	DBLP DOI BibTeX RDF	Planar graphs, List coloring
12	Ashwin Ganesan	On Some Sufficient Conditions for Distributed Quality-of-Service Support in Wireless Networks.	NetCoM	2009	DBLP DOI BibTeX RDF	weighted vertex coloring, quality-of-service (QoS), wireless networks, distributed algorithms, conflict graph, interference models, fractional
12	Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai	Improved bounds for scheduling conflicting jobs with minsum criteria.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	sum multicoloring, scheduling, Approximation algorithms, linear programming, coloring, LP rounding
12	Egbert Mujuni	Parameterized Algorithms in Smooth 4-Regular Hamiltonian Graphs.	Math. Comput. Sci.	2008	DBLP DOI BibTeX RDF	Algorithm, graph coloring, independent set, parameterized complexity
12	Joseph Gil, William W. Pugh, Grant E. Weddell, Yoav Zibin	Two-dimensional bidirectional object layout.	ACM Trans. Program. Lang. Syst.	2008	DBLP DOI BibTeX RDF	coloring, hierarchy, inheritance, layout, bidirectional
12	Roland Ducournau	Perfect hashing as an almost perfect subtype test.	ACM Trans. Program. Lang. Syst.	2008	DBLP DOI BibTeX RDF	downcast, method tables, multiple subtyping, single inheritance, subtype test, virtual function tables, Java, C++, interfaces, coloring, multiple inheritance, perfect hashing, Casting, dynamic loading
12	Yi Yang 0002, Sencun Zhu, Guohong Cao	Improving sensor network immunity under worm attacks: a software diversity approach.	MobiHoc	2008	DBLP DOI BibTeX RDF	sensor worm, graph coloring, sensor network security, percolation theory, software diversity
12	Ming-Jye Lee, Chi-Chang Chen, Chien-Ning Yeh	Permutation Routing in All-Optical Multistage Clos Network.	ITNG	2008	DBLP DOI BibTeX RDF	Optical Crosstalk, Rearrangeable non-blocking, Paull’s Matrix, Edge Coloring, Clos network
12	Xiaoming Sun 0001, Andrew Chi-Chih Yao, Christophe Tartary	Graph Design for Secure Multiparty Computation over Non-Abelian Groups.	ASIACRYPT	2008	DBLP DOI BibTeX RDF	Graph Coloring, Multiparty Computation, Percolation Theory, Non-Abelian Groups, Passive Adversary
12	Florent Bouchez, Alain Darte, Fabrice Rastello	Advanced conservative and optimistic register coalescing.	CASES	2008	DBLP DOI BibTeX RDF	coloring number, greedy-k-colorable graph, register allocation, chordal graph, register coalescing
12	Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono 0001, Yushi Uno	An Algorithm for L(2, 1)-Labeling of Trees.	SWAT	2008	DBLP DOI BibTeX RDF	frequency/channel assignment, L(2 and 1)-labeling, graph algorithm, vertex coloring
12	Ben-Jye Chang, Bo-Jhang Huang, Ying-Hsin Liang	Wireless Sensor Network-Based Adaptive Vehicle Navigation in Multihop-Relay WiMAX Networks.	AINA	2008	DBLP DOI BibTeX RDF	fully distributed, re-routing, wireless sensor networks, coloring, traffic density, Adaptive navigation
12	Weiming Zhang, Xinpeng Zhang 0001, Shuozhong Wang	Twice Gric Colorings in Steganography.	IIH-MSP	2008	DBLP DOI BibTeX RDF	embedding efficiency, change rate, rainbow coloring, steganography, information rate
12	Rohit Gupta, Sumit Kumar Bose, Srikanth Sundarrajan, Manogna Chebiyam, Anirban Chakrabarti	A Two Stage Heuristic Algorithm for Solving the Server Consolidation Problem with Item-Item and Bin-Item Incompatibility Constraints.	IEEE SCC (2)	2008	DBLP DOI BibTeX RDF	bin packing with constraints, graph precoloring, heuristic, graph coloring, server consolidation
12	Vincenzo Cutello, Giuseppe Nicosia, Mario Pavone	An immune algorithm with stochastic aging and kullback entropy for the chromatic number problem.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Chromatic number problem, Combinatorial optimization, Immune Algorithm, Information Gain, Graph coloring problem
12	Yuan Yuan 0035, Paramvir Bahl, Ranveer Chandra, Thomas Moscibroda, Yunnan Wu	Allocating dynamic time-spectrum blocks in cognitive radio networks.	MobiHoc	2007	DBLP DOI BibTeX RDF	adaptive channel-width, interval coloring, cognitive radio networks, spectrum allocation
12	Dae Wan Cho, Hyeon Soo Kim, Seunguk Oh	A new approach to detecting memory access errors in C programs.	ACIS-ICIS	2007	DBLP DOI BibTeX RDF	bitmap coloring, software testing, code instrumentation, memory error
12	Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky	Weakening the online adversary just enough to get optimal conflict-free colorings for intervals.	SPAA	2007	DBLP DOI BibTeX RDF	online algorithms, coloring, cellular networks, frequency assignment, conflict free
12	Kazuhiro Suzuki	A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph.	Graphs Comb.	2006	DBLP DOI BibTeX RDF	Heterochromatic, Spanning tree, Edge-coloring, Rainbow, Multicolored
12	Howon Kim 0002, In-So Kweon	Appearance-Cloning: Photo-Consistent Scene Recovery from Multi-View Images.	Int. J. Comput. Vis.	2006	DBLP DOI BibTeX RDF	volumetric reconstruction, voxel coloring, photo-consistency, color similarity, image-based modeling, appearance, space carving
12	Shing-Tsaan Huang, Chi-Hung Tzeng	Distributed Edge Coloration for Bipartite Networks.	SSS	2006	DBLP DOI BibTeX RDF	Fault-tolerance, Distributed system, Self-stabilization, Edge coloring
12	Abtin Keshavarzian, Huang Lee, Lakshmi Venkatraman	Wakeup scheduling in wireless sensor networks.	MobiHoc	2006	DBLP DOI BibTeX RDF	energy-efficient algorithms, graph coloring algorithms, power-delay tarde-off, wakeup scheduling, wireless sensor network, cross-layer protocols
12	Weizhao Wang, Xiang-Yang Li 0001, Ophir Frieder, Yu Wang 0003, Wen-Zhan Song 0001	Efficient interference-aware TDMA link scheduling for static wireless networks.	MobiCom	2006	DBLP DOI BibTeX RDF	wireless networks, distributed algorithm, interference, graph coloring, link scheduling
12	Noga Alon, Shakhar Smorodinsky	Conflict-free colorings of shallow discs.	SCG	2006	DBLP DOI BibTeX RDF	conflict-free coloring, wireless, combinatorics, frequency-assignment
12	Michael B. Dillencourt, David Eppstein, Michael T. Goodrich	Choosing Colors for Geometric Graphs Via Color Space Embeddings.	GD	2006	DBLP DOI BibTeX RDF	graph coloring, graph drawing, color space, color perception
12	Sanjeev Arora, Eden Chlamtac	New approximation guarantee for chromatic number.	STOC	2006	DBLP DOI BibTeX RDF	approximation algorithms, graph coloring, semidefinite programming, chromatic number
12	Bong-Jun Ko, Dan Rubenstein	Distributed self-stabilizing placement of replicated resources in emerging networks.	IEEE/ACM Trans. Netw.	2005	DBLP DOI BibTeX RDF	convergence, graph coloring, replica placement
12	Thomas Erlebach, Stamatis Stefanakos	Wavelength Conversion in All-Optical Networks with Shortest-Path Routing.	Algorithmica	2005	DBLP DOI BibTeX RDF	Wavelength converter placement, Bipartization, Sufficient set, L-reduction, Graph algorithm, Wavelength assignment, Edge coloring
12	Dominique de Werra, Pierre Hansen	Variations on the Roy-Gallai theorem.	4OR	2005	DBLP DOI BibTeX RDF	panchromatic chains, stable sets, Graph coloring, chromatic number, longest path
12	Enyue Lu, S. Q. Zheng 0001	Parallel Routing Algorithms for Nonblocking Electronic and Photonic Switching Networks.	IEEE Trans. Parallel Distributed Syst.	2005	DBLP DOI BibTeX RDF	rearrangeable nonblocking network, strictly nonblocking network, parallel algorithm, graph coloring, crosstalk, optical switching, Banyan network, self-routing, switch control
12	Jianping Li, Kang Li, Lusheng Wang 0001, Hao Zhao	Maximizing Profits of Routing in WDM Networks.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	routing, approximation algorithm, minimum-cost flow, path coloring
12	Murali S. Kodialam, Thyaga Nandagopal	Characterizing the capacity region in multi-radio multi-channel wireless mesh networks.	MobiCom	2005	DBLP DOI BibTeX RDF	scheduling, optimization, algorithms, routing, wireless networks, graph coloring, capacity
12	Yi-Chin Huang, Yi-Shin Tung, Jun-Cheng Chen, Sung-Wen Wang, Ja-Ling Wu	An adaptive edge detection based colorization algorithm and its applications.	ACM Multimedia	2005	DBLP DOI BibTeX RDF	chrominance coding, re-coloring, colorization, color transfer
12	E. Syam Sundar Reddy, Vikram Chandrasekhar, Milagros Sashikánth, V. Kamakoti 0001, Narayanan Vijaykrishnan	Detecting SEU-Caused Routing Errors in SRAM-Based FPGAs.	VLSI Design	2005	DBLP DOI BibTeX RDF	Complex Logic Blocks, Routing Errors, Vertex Coloring problem, Fault Tolerance, Field Programmable Gate Arrays, Graph Theory, Single Event Upset
12	H. Van Dyke Parunak, Sven Brueckner, John A. Sauter, Robert S. Matthews	Global convergence of local agent behaviors.	AAMAS	2005	DBLP DOI BibTeX RDF	clustering, convergence, graph coloring, vehicle routing, emergent behavior
12	Xiao Zhou 0001, Takao Nishizeki	Multicolorings of Series-Parallel Graphs.	Algorithmica	2004	DBLP DOI BibTeX RDF	Coloring, Series-parallel graph, Dynamic programming algorithm, Multicoloring
12	Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick	Existential second-order logic over graphs: Charting the tractability frontier.	J. ACM	2004	DBLP DOI BibTeX RDF	Existential second-order logic, graph constraints, prefix classes, graph coloring, NP-complete problems, finite model theory
12	Mark N. Ellingham, Herbert Fleischner, Martin Kochol, Emanuel Wenger	Colorability of Planar Graphs with Isolated Nontriangular Faces.	Graphs Comb.	2004	DBLP DOI BibTeX RDF	Eulerian triangulation, Hole graph, 3-Coloring
12	Seog-Jin Kim, Kittikorn Nakprasit	On the Chromatic Number of the Square of the Kneser Graph K(2 k+1, k).	Graphs Comb.	2004	DBLP DOI BibTeX RDF	Kneser graph, Intersecting family, Graph coloring, Square
12	Praveen K. Murthy, Shuvra S. Bhattacharyya	Buffer merging - a powerful technique for reducing memory requirements of synchronous dataflow specifications.	ACM Trans. Design Autom. Electr. Syst.	2004	DBLP DOI BibTeX RDF	DSP and embedded systems, array lifetime, block diagram compiler, buffer overlaying, lifetime analysis, design methodology, graph coloring, dataflow, memory optimization, Synchronous dataflow, path covering
12	Shuvra S. Bhattacharyya, Praveen K. Murthy	The CBP Parameter: A Module Characterization Approach for DSP Software Optimization.	J. VLSI Signal Process.	2004	DBLP DOI BibTeX RDF	array lifetime, block diagram compilers, buffer overlaying, lifetime analysis, embedded systems, design methodology, graph coloring, dataflow
12	Zhengbing Bian, Qian-Ping Gu, Xiao Zhou 0001	Wavelength Assignment on Bounded Degree Trees of Rings.	ICPADS	2004	DBLP DOI BibTeX RDF	trees of rings, approximation algorithms, Wavelength assignment, path coloring
12	Dimitris Achlioptas, Assaf Naor	The two possible values of the chromatic number of a random graph.	STOC	2004	DBLP DOI BibTeX RDF	graph coloring, random graphs, chromatic number
12	Shing-Tsaan Huang, Ying-Sung Huang, Su-Shen Hung	Alternators on uniform rings of odd size.	Distributed Comput.	2003	DBLP DOI BibTeX RDF	Self-stabilization, Graph coloring, Clock synchronization, Concurrent processes, Alternator
12	Yusheng Li 0001, Wenan Zang	The Independence Number of Graphs with a Forbidden Cycle and Ramsey Numbers.	J. Comb. Optim.	2003	DBLP DOI BibTeX RDF	Ramsey number, graph coloring, probabilistic method, independence number
12	Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman	Short length menger's theorem and reliable optical routing.	SPAA	2003	DBLP DOI BibTeX RDF	flow number, menger's theorem, fault-tolerant routing, path coloring
12	Sven Brueckner, H. Van Dyke Parunak	Information-driven phase changes in multi-agent coordination.	AAMAS	2003	DBLP DOI BibTeX RDF	adaptation, graph coloring, scaling, phase change
12	Lars Wittenburg, Weixiong Zhang	Distributed breakout algorithm for distributed constraint optimization problems -- DBArelax.	AAMAS	2003	DBLP DOI BibTeX RDF	distributed breakout, distributed coloring, sensor networks
12	Andrea Vietri	Combinatorial Aspects of Total Weight Orders over Monomials of Fixed Degree.	Order	2002	DBLP DOI BibTeX RDF	Gröbner bases, monomial ordering, weight order, coloring, linearization, primes, linear inequalities, logical consequence
12	Shi-Jinn Horng, Horng-Ren Tsai, Yi Pan 0001, Jennifer Seitzer	Optimal Algorithms for the Channel-Assignment Problem on a Reconfigurable Array of Processors with Wider Bus Networks.	IEEE Trans. Parallel Distributed Syst.	2002	DBLP DOI BibTeX RDF	minimum coloring problem, reconfigurable array of processors with wider bus networks, parallel algorithm, interval graph, list ranking, integer sorting, Channel-assignment problem
12	Sean E. Anderson, Marc Levoy	Unwrapping and Visualizing Cuneiform Tablets.	IEEE Computer Graphics and Applications	2002	DBLP DOI BibTeX RDF	cuneiform, clay tablets, accessibility coloring, visualization, cultural heritage, 3D scanning, displacement maps
12	Francisco Tanudjaja, Lik Mu	Persona: A Contextualized and Personalized Web Search.	HICSS	2002	DBLP DOI BibTeX RDF	tree coloring, graph-based web search, ontology, HITS algorithm
12	Kohei Miyase, Seiji Kajihara, Sudhakar M. Reddy	A Method of Static Test Compaction Based on Don't Care Identification.	DELTA	2002	DBLP DOI BibTeX RDF	Coloring Problem, Don't Care Identification, ATPG, Static Test Compaction
12	Marc Andries, Luca Cabibbo, Jan Paredaens, Jan Van den Bussche	Applying an update method to a set of receivers.	ACM Trans. Database Syst.	2001	DBLP DOI BibTeX RDF	order independence, parallel update, schema coloring, relational algebra, database update
12	Thomas F. Coleman, Arun Verma	ADMIT-1: automatic differentiation and MATLAB interface toolbox.	ACM Trans. Math. Softw.	2000	DBLP DOI BibTeX RDF	Jacobians and Hessians, computational differentiation, efficient computation of gradient, user interface, graph coloring, MATLAB, automatic differentiation
12	Xiao Zhou 0001, Syurei Tamura, Takao Nishizeki	Finding Edge-Disjoint Paths in Partial k-Trees.	Algorithmica	2000	DBLP DOI BibTeX RDF	Polynomial-time algorithm, Edge-coloring, Edge-disjoint paths, Partial k -tree, Bounded treewidth
12	Stefan Felsner, Ferran Hurtado, Marc Noy, Ileana Streinu	Hamiltonicity and colorings of arrangement graphs.	SODA	2000	DBLP BibTeX RDF	Hamilton decomposition, Hamilton path, circle and pseudocircle arrangement, line and pseudoline arrangement, projective-planar graph, connectivity, coloring, planar graph, Hamilton cycle
12	Fernando Adrian Das Neves, Edward A. Fox	A study of user behavior in an immersive virtual environment for digital libraries.	ACM DL	2000	DBLP DOI BibTeX RDF	query coloring, clustering, interaction design, virtual environments
12	Giuseppe Di Battista, Roberto Tamassia, Luca Vismara	Output-Sensitive Reporting of Disjoint Paths.	Algorithmica	1999	DBLP DOI BibTeX RDF	Triconnected graph, Biconnected graph, Connectivity, Coloring, Graph drawing, Disjoint paths
12	Olivier Coudert	A New Paradigm for Dichotomy-based Constrained Encoding.	DATE	1998	DBLP DOI BibTeX RDF	constrained state encoding, twin graph coloring, dichotomy
12	Ravi Jain, Kiran Somalwar, John Werth, James C. Browne	Heuristics for Scheduling I/O Operations.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	Data transfer scheduling, graph edge coloring, I/O bottleneck, multiprocessor operating systems, simultaneous resource scheduling, parallel I/O, scheduling heuristics
12	Jon M. Kleinberg, Rajeev Motwani 0001, Prabhakar Raghavan, Suresh Venkatasubramanian	Storage Management for Evolving Databases.	FOCS	1997	DBLP DOI BibTeX RDF	Storage techniques, optimization, databases, online algorithms, graph coloring
12	Darko Kirovski, Chunho Lee, Miodrag Potkonjak, William H. Mangione-Smith	Application-driven synthesis of core-based systems.	ICCAD	1997	DBLP DOI BibTeX RDF	application-specific system-level synthesis, system modeling and performance evaluation, cache line coloring
12	Xiao Zhou 0001, Syurei Tamura, Takao Nishizeki	Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract).	ISAAC	1996	DBLP DOI BibTeX RDF	bounded tree-width, polynomial-time algorithm, edge-coloring, edge-disjoint paths, partial k-tree
12	Xiaojun Shen	An Optimal O(NlgN) Algorithm for Permutation Admissibility to Extra-Stage Cube-Type Networks.	IEEE Trans. Computers	1995	DBLP DOI BibTeX RDF	extra-stage cube-type network, permutation admissibility, lower bound, graph coloring, Conflict graph
12	Christine Makowski, Lori L. Pollock	Achieving efficient register allocation via parallelism.	SAC	1995	DBLP DOI BibTeX RDF	cique separators, parallel register allocation, graph coloring
12	Sanjeev Mahajan, Ramesh Hariharan	Derandomizing Semidefinite Programming Based Approximation Algorithms.	FOCS	1995	DBLP DOI BibTeX RDF	semidefinite programming based approximation algorithms, Max k-Cut, Max-Dicut, Max-Bisection, k Vertex Coloring, polynomial time randomized algorithms, polynomial time deterministic algorithms, computational complexity, randomized algorithms, semidefinite programming, programming theory, NP-Complete problems, deterministic algorithms, Independent Set, randomised algorithms, Max-Cut, Max-Sat
12	Milena Mihail, Christos Kaklamanis, Satish Rao	Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings.	FOCS	1995	DBLP DOI BibTeX RDF	efficient access, optical bandwidth wavelength routing, directed fiber trees, directed graph models, trees of rings, fiber links, physical directedness, optical amplifiers, polynomial time routing algorithm, optical wavelengths, fixed W wavelength technology, optical routing requirements, coloring paradigms, multicolored alternating cycles, averaging analysis, directed graphs, trees (mathematics), wavelength division multiplexing, wavelength division multiplexing, graph colouring, optical communication, approximation factor, WDM optical networks, ring topologies, tree topologies
12	Moni Naor, Leonard J. Schulman, Aravind Srinivasan	Splitters and Near-Optimal Derandomization.	FOCS	1995	DBLP DOI BibTeX RDF	splitters, near-optimal derandomization, fairly general method, k-restrictions, probabilistic bound, near-optimal constructions, fixed-subgraph finding algorithms, deterministic constructions, local-coloring protocol, computational complexity, learning, probability, computational linguistics, hardness of approximation, set cover, derandomization, randomised algorithms, exhaustive testing
12	Carsten Lund, Mihalis Yannakakis	On the Hardness of Approximating Minimization Problems.	J. ACM	1994	DBLP DOI BibTeX RDF	clique cover, approximation algorithms, NP-hard, graph coloring, dominating set, set cover, independent set, chromatic number, probabilistically checkable proofs, hitting set
12	Baruch Awerbuch, Yossi Azar	Local Optimization of Global Objectives: Competitive Distributed Deadlock Resolution and Resource Allocation	FOCS	1994	DBLP DOI BibTeX RDF	minimum fractional coloring, global objectives, competitive distributed deadlock resolution, distributed server-client architectures, distributed bandwidth management, globally-optimum performance, maximum fractional independent set, distributed computing, resource allocation, admission control, communication networks, communication networking, job scheduling, network throughput, local optimization
12	Haim Kaplan, Ron Shamir, Robert Endre Tarjan	Tractability of parameterized completion problems on chordal and interval graphs: Minimum Fill-in and Physical Mapping	FOCS	1994	DBLP DOI BibTeX RDF	added edges, parameterized completion problems, minimum fill-in, NP-Hard graph completion problem, interval graphs, parameterized complexity, tractability, vertex coloring, physical mapping