|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1651 occurrences of 861 keywords
|
|
|
Results
Found 5849 publication records. Showing 5849 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
29 | Jaikumar Radhakrishnan, Aravind Srinivasan |
Improved Bounds and Algorithms for Hypergraph Two-Coloring. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
Hypergraph coloring, The Probabilistic Method, Lovasz Local Lemma |
29 | Uriel Feige, Joe Kilian |
Heuristics for Finding Large Independent Sets, with Applications to Coloring Semi-Random Graphs. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
Graph Coloring, Semidefinite Programming, Independent Sets |
29 | Xiao-Tao Chen, Fabrizio Lombardi |
A coloring approach to the structural diagnosis of interconnects. |
ICCAD |
1996 |
DBLP DOI BibTeX RDF |
interconnect, Diagnosis, graph coloring, syndrome |
29 | Takehiro Ito, Marcin Kaminski 0001, Erik D. Demaine |
Reconfiguration of List Edge-Colorings in a Graph. |
WADS |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Venkatesan Guruswami, Ali Kemal Sinop |
Improved Inapproximability Results for Maximum k-Colorable Subgraph. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz |
Improved Approximation Algorithm for Convex Recoloring of Trees. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
Convex recoloring, Approximation algorithms, Phylogenetic trees, Local ratio |
29 | Stefan Geschke |
Potential continuity of colorings. |
Arch. Math. Log. |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) Primary 03E35, Secondary 54H99, 05D10 |
29 | Julius Degesys, Radhika Nagpal |
Towards Desynchronization of Multi-hop Topologies. |
SASO |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Balázs Keszegh |
Polychromatic Colorings of n-Dimensional Guillotine-Partitions. |
COCOON |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Dániel Marx |
The complexity of chromatic strength and chromatic edge strength. |
Comput. Complex. |
2006 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification |
29 | Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini |
Dotted interval graphs and high throughput genotyping. |
SODA |
2005 |
DBLP BibTeX RDF |
|
29 | Daniel Gonçalves 0001, Mickaël Montassier |
Acyclic Choosability of Graphs with Small Maximum Degree. |
WG |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Shlomo Moran, Sagi Snir |
Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms. |
WADS |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz |
Improved Approximation Algorithm for Convex Recoloring of Trees. |
WAOA |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger |
Backbone Colorings for Networks. |
WG |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Rui Min, Yiming Hu |
Improving Performance of Large Physically Indexed Caches by Decoupling Memory Addresses from Cache Addresses. |
IEEE Trans. Computers |
2001 |
DBLP DOI BibTeX RDF |
Novel memory architectures, cache, memory systems, TLB, performance enhancement |
29 | Thomas Erlebach, Danica Vukadinovic |
New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs. |
FCT |
2001 |
DBLP DOI BibTeX RDF |
|
29 | Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai |
Minimizing Average Completion of Dedicated Tasks and Interval Graphs. |
RANDOM-APPROX |
2001 |
DBLP DOI BibTeX RDF |
|
29 | Leo G. Kroon, Arunabha Sen, Haiyong Deng, Asim Roy |
The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs. |
WG |
1996 |
DBLP DOI BibTeX RDF |
|
29 | Xiao Zhou 0001, Takao Nishizeki |
Algorithms for Finding f-Colorings of Partial k-Trees. |
ISAAC |
1995 |
DBLP DOI BibTeX RDF |
|
29 | Arthur L. Liestman, Dana S. Richards |
Network Communication in Edge-Colored Graphs: Gossiping. |
IEEE Trans. Parallel Distributed Syst. |
1993 |
DBLP DOI BibTeX RDF |
scheduling communications, scheduling, multiprocessor interconnection networks, gossiping, network communication, graph colouring, edge-colored graphs |
29 | Rajiv Gupta 0001, Mary Lou Soffa, Tim Steele |
Register Allocation via Clique Separators. |
PLDI |
1989 |
DBLP DOI BibTeX RDF |
|
27 | Jing Liu 0006, Weicai Zhong, Licheng Jiao |
Comments on "The 1993 DIMACS graph coloring Challenge" and "Energy function-based approaches to graph Coloring". |
IEEE Trans. Neural Networks |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Johannes Schneider 0002, Roger Wattenhofer |
Brief announcement: efficient graph algorithms without synchronization. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
parallel algorithms, coloring, dominating sets, concurrent data structures |
26 | Shing-Tsaan Huang, Chi-Hung Tzeng |
Distributed edge coloration for bipartite networks. |
Distributed Comput. |
2009 |
DBLP DOI BibTeX RDF |
Fault-tolerance, Distributed system, Self-stabilization, Edge coloring |
26 | Li Wang 0027, Xuejun Yang, Jingling Xue, Yu Deng 0001, Xiaobo Yan, Tao Tang 0001, Quan Hoang Nguyen 0001 |
Optimizing scientific application loops on stream processors. |
LCTES |
2008 |
DBLP DOI BibTeX RDF |
streaming, prefetching, graph coloring, data reuse, loop optimization, stream processor, software-managed cache |
26 | Haytham Elghazel, Tetsuya Yoshida, Mohand-Said Hacid |
An Integrated Graph and Probability Based Clustering Framework for Sequential Data. |
Discovery Science |
2008 |
DBLP DOI BibTeX RDF |
graphb-coloring, Clustering, EM algorithm, sequential data |
26 | Noga Alon, Robert Berke, Kevin Buchin, Maike Buchin, Péter Csorba, Saswata Shannigrahi, Bettina Speckmann, Philipp Zumstein |
Polychromatic colorings of plane graphs. |
SCG |
2008 |
DBLP DOI BibTeX RDF |
graph coloring |
26 | Youming Qiao, Christophe Tartary |
Counting Method for Multi-party Computation over Non-abelian Groups. |
CANS |
2008 |
DBLP DOI BibTeX RDF |
Neighbor-Avoiding Walk, Random Walk, Graph Coloring, Multiparty Computation, Non-Abelian Groups, Passive Adversary |
26 | Aris Pagourtzis, Katerina Potika, Stathis Zachos |
Path multicoloring with fewer colors in spiders and caterpillars. |
Computing |
2007 |
DBLP DOI BibTeX RDF |
multifiber all-optical networks, caterpillars, approximation algorithms, Path coloring, spiders |
26 | Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh 0001, Stefan Szeider, Carsten Thomassen |
On the Complexity of Some Colorful Problems Parameterized by Treewidth. |
COCOA |
2007 |
DBLP DOI BibTeX RDF |
Topics Parameterized Complexity, Graph Coloring, Bounded Treewidth |
26 | Takuya Nakaike, Tatsushi Inagaki, Hideaki Komatsu, Toshio Nakatani |
Profile-based global live-range splitting. |
PLDI |
2006 |
DBLP DOI BibTeX RDF |
live-range splitting, graph coloring, register allocation |
26 | Nathalie Mitton, Eric Fleury, Isabelle Guérin Lassous, Bruno Sericola, Sébastien Tixeuil |
Fast Convergence in Self-Stabilizing Wireless Networks. |
ICPADS (1) |
2006 |
DBLP DOI BibTeX RDF |
stabilization time, scheduling, coloring, multihop wireless networks |
26 | Stratis Ioannidis, Christos Nomikos, Aris Pagourtzis, Stathis Zachos |
Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree. |
Panhellenic Conference on Informatics |
2005 |
DBLP DOI BibTeX RDF |
routing and path coloring, optical networking, wavelength assignment, WDM networks |
26 | Jinpyo Park, Soo-Mook Moon |
Optimistic register coalescing. |
ACM Trans. Program. Lang. Syst. |
2004 |
DBLP DOI BibTeX RDF |
Copy coalescing, noncopy coalescing, graph coloring, register allocation |
26 | Günther Nürnberger, Frank Zeilfelder |
Lagrange Interpolation by Bivariate C1-Splines with Optimal Approximation Order. |
Adv. Comput. Math. |
2004 |
DBLP DOI BibTeX RDF |
local Lagrange interpolation, optimal approximation order, Clough-Tocher split, coloring, triangulation, scattered data, bivariate splines |
26 | Yi Tang 0001, Jiming Liu 0001, Xiaolong Jin |
Agent Compromises in Distributed Problem Solving. |
IDEAL |
2003 |
DBLP DOI BibTeX RDF |
Agent Compromises, Distributed GCP Solving, Graph Coloring Problem, Distributed Constraint Satisfaction Problem |
26 | Hans van Maaren, Linda van Norden |
Hidden Threshold Phenomena for Fixed-Density SAT-formulae. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
Horn, graph-3-coloring, satisfiability, thresholds, 3-SAT |
26 | Noga Alon, Ayal Zaks |
Algorithmic Aspects of Acyclic Edge Colorings. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
Acyclic edge coloring, Girth |
26 | Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger |
More about Subcolorings. |
WG |
2002 |
DBLP DOI BibTeX RDF |
subcoloring, special graph classes, computational complexity, graph coloring, polynomial time algorithm |
26 | Wolfgang Slany |
The Complexity of Graph Ramsey Games. |
Computers and Games |
2000 |
DBLP DOI BibTeX RDF |
combinatorial games, graph Ramsey theory, Ramsey game, winning strategy, achievement game, avoidance game, the game of Sim, endgames, complexity, Java applet, edge coloring, PSPACE-completeness |
26 | Lal George, Andrew W. Appel |
Iterated Register Coalescing. |
ACM Trans. Program. Lang. Syst. |
1996 |
DBLP DOI BibTeX RDF |
copy propagation, graph coloring, register allocation, register coalescing |
26 | Joaquim S. Madeira, André Stork, Markus H. Gross |
An approach to computer-supported cartooning. |
Vis. Comput. |
1996 |
DBLP DOI BibTeX RDF |
Computer-supported cartooning, Coloring, Shape-matching, Painting, Image structuring, Vector representation |
26 | Eric Bach 0001, Anne Condon, Elton Glaser, Celena Tanguay |
DNA Models and Algorithms for NP-complete Problems. |
CCC |
1996 |
DBLP DOI BibTeX RDF |
3Sat, 3-Coloring, Independent Set problem, DNA algorithms, genetic algorithms, computational complexity, search problems, DNA computing, DNA computation, NP-complete problems, search algorithms, NP-hard problems |
24 | Zhang Long, Pan Dashan, Li Yang, Fang Tao, Liang Chao, Li Li |
Traffic-Aware Spectrum Assignment in Wireless Networks. |
NAS |
2011 |
DBLP DOI BibTeX RDF |
spectrum assignment, graph interval coloring, max-coloring, mesh networks, multi-channel |
24 | Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Giuseppe Persiano |
Directed Tree Networks. |
Encyclopedia of Optimization |
2009 |
DBLP DOI BibTeX RDF |
Bipartite edge coloring, Approximation algorithms, Optical networks, Path coloring |
24 | Qinglin Yu, Lian-Cui Zuo |
Fractional Vertex Arboricity of Graphs. |
CJCDGCGT |
2005 |
DBLP DOI BibTeX RDF |
vertex arboricity, tree coloring, fractional vertex arboricity, fractional tree coloring |
24 | Bonnie Berger, John Rompel |
Simulating (log ^c n)-wise Independence in NC |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
hypergraph coloring problem, randomness removal, (log/sup c/n)-wise independence, randomized NC algorithms, polylogarithmic independence, RNC algorithms, set discrepancy problem, NC edge-coloring algorithm, simulation |
24 | Çagatay Demiralp, John F. Hughes, David H. Laidlaw |
Coloring 3D Line Fields Using Boy's Real Projective Plane Immersion. |
IEEE Trans. Vis. Comput. Graph. |
2009 |
DBLP DOI BibTeX RDF |
|
24 | André C. Pinho, Alexandre A. Santos, Daniel R. Figueiredo 0001, Felipe M. G. França |
Two ID-Free Distributed Distance-2 Edge Coloring Algorithms for WSNs. |
Networking |
2009 |
DBLP DOI BibTeX RDF |
distance-2, WSN, algorithms, MAC |
24 | Adam Roman |
Decision Version of the Road Coloring Problem Is NP-Complete. |
FCT |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Akiyoshi Shioura, Mutsunori Yagiura |
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions. |
COCOON |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Thomas Moscibroda, Roger Wattenhofer |
Coloring unstructured radio networks. |
Distributed Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Wen-Qing Xu, Solomon W. Golomb |
Two-Dimensional Array Coloring With Many Colors. |
IEEE Trans. Inf. Theory |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Ken-ichi Kawarabayashi |
Approximating List-Coloring on a Fixed Surface. |
ICALP (1) |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Kamalika Chaudhuri, Fan Chung Graham, Mohammad Shoaib Jamall |
A Network Coloring Game. |
WINE |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Joseph Wun-Tat Chan, Francis Y. L. Chin, Xiangyu Hong, Hing-Fung Ting |
Dynamic Offline Conflict-Free Coloring for Unit Disks. |
WAOA |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Zdenek Dvorák 0001, Daniel Král, Robin Thomas 0001 |
Coloring Triangle-Free Graphs on Surfaces. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick |
New Bounds for the Nearly Equitable Edge Coloring Problem. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Ioannis Milis, Aris Pagourtzis, Katerina Potika |
Selfish Routing and Path Coloring in All-Optical Networks. |
CAAN |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Zbigniew Kokosinski, Krzysztof Kwarciany |
On Sum Coloring of Graphs with Parallel Genetic Algorithms. |
ICANNGA (1) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Xin Han, Kazuo Iwama, Rolf Klein, Andrzej Lingas |
Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs. |
AAIM |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Mikko Koivisto |
An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Zeeshan Anwar, Frank P. Ferrie |
Towards Robust Voxel-Coloring: Handling Camera Calibration Errors and Partial Emptiness of Surface Voxels. |
ICPR (1) |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Zhiwei Lin 0003, Li Xu 0002, Dajin Wang, Jianliang Gao |
A Coloring Based Backbone Construction Algorithm in Wireless Ad Hoc Network. |
GPC |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Christopher L. Barrett, V. S. Anil Kumar 0001, Madhav V. Marathe, Shripad Thite, Gabriel Istrate |
Strong Edge Coloring for Channel Assignment in Wireless Radio Networks. |
PerCom Workshops |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Muthusrinivasan Muthuprasanna, G. Manimaran, Mansoor Alicherry, Vijay Kumar |
Coloring the Internet: IP Traceback. |
ICPADS (1) |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Arunesh Mishra, Suman Banerjee 0001, William A. Arbaugh |
Weighted coloring based channel assignment for WLANs. |
ACM SIGMOBILE Mob. Comput. Commun. Rev. |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Yossi Chait, C. V. Hollot, Vishal Misra, Donald F. Towsley, Honggang Zhang 0003, Yong Cui |
Throughput differentiation using coloring at the network edge and preferential marking at the core. |
IEEE/ACM Trans. Netw. |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Sariel Har-Peled, Shakhar Smorodinsky |
Conflict-Free Coloring of Points and Simple Regions in the Plane. |
Discret. Comput. Geom. |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Garud Iyengar, David J. Phillips, Clifford Stein 0001 |
Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring. |
IPCO |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Peter Sanders 0001, David Steurer |
An asymptotic approximation scheme for multigraph edge coloring. |
SODA |
2005 |
DBLP BibTeX RDF |
|
24 | Martin Kochol, Nad'a Krivonáková, Silvia Smejová |
Approximation Algorithm for Chromatic Index and Edge-Coloring of Multigraphs. |
WEA |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Yanli Sun, Lei Sun |
The (Adjacent) Vertex-Distinguishing Total Coloring of the Mycielski Graphs and the Cartesian Product Graphs. |
CJCDGCGT |
2005 |
DBLP DOI BibTeX RDF |
AMS Subject Classification 05C15 |
24 | Albert Atserias |
On Digraph Coloring Problems and Treewidth Duality. |
LICS |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Erik G. Boman, Doruk Bozdag, Ümit V. Çatalyürek, Assefaw Hadish Gebremedhin, Fredrik Manne |
A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers. |
Euro-Par |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Takafumi Saito, Hiroko Nakamura Miyamura, Mitsuyoshi Yamamoto, Hiroki Saito, Yuka Hoshiya, Takumi Kaseda |
Two-Tone Pseudo Coloring: Compact Visualization for One-Dimensional Data. |
INFOVIS |
2005 |
DBLP DOI BibTeX RDF |
pseudo color, detail, data density, focus+context, overview |
24 | Keith D. Cooper, Anshuman Dasgupta, Jason Eckhardt |
Revisiting Graph Coloring Register Allocation: A Study of the Chaitin-Briggs and Callahan-Koblenz Algorithms. |
LCPC |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Andrew Lim 0001, Fan Wang 0003 |
Robust Graph Coloring for Uncertain Supply Chain Management. |
HICSS |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Ünal Ufuktepe, Goksen Bacak |
Applications of Graph Coloring. |
ICCSA (3) |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou |
A Tight Bound for Online Coloring of Disk Graphs. |
SIROCCO |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Jianping Li, Kang Li, Ken C. K. Law, Hao Zhao |
On Packing and Coloring Hyperedges in a Cycle. |
COCOON |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Xujin Chen, Xiao-Dong Hu 0001, Xiaohua Jia |
Complexity of Minimal Tree Routing and Coloring. |
AAIM |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Assefaw Hadish Gebremedhin, Fredrik Manne, Tom Woods |
Speeding up Parallel Graph Coloring. |
PARA |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Leonid S. Bershtein, Alexander V. Bozhenyuk, Igor N. Rozenberg |
Fuzzy Coloring of Fuzzy Hypergraph. |
Fuzzy Days |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda |
Randomly Coloring Constant Degree Graphs. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Lukasz Kowalik |
Fast 3-Coloring Triangle-Free Planar Graphs. |
ESA |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Jennie C. Hansen, Marek Kubale, Lukasz Kuszner, Adam Nadolski |
Distributed Largest-First Algorithm for Graph Coloring. |
Euro-Par |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Zbigniew Kokosinski, Marcin Kolodziej, Krzysztof Kwarciany |
Parallel Genetic Algorithm for Graph Coloring Problem. |
International Conference on Computational Science |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Andrew Lim 0001, Fan Wang 0003 |
Meta-Heuristics for Robust Graph Coloring Problem. |
ICTAI |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Songshan Guo, Ying Kong, Andrew Lim 0001, Fan Wang 0003 |
A New Neighborhood Based on Improvement Graph for Robust Graph Coloring Problem. |
Australian Conference on Artificial Intelligence |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Hung Q. Ngo 0001, Van H. Vu |
Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs. |
SODA |
2003 |
DBLP BibTeX RDF |
|
24 | Martin Kochol |
Linear Algorithm for 3-Coloring of Locally Connected Graphs. |
WEA |
2003 |
DBLP DOI BibTeX RDF |
|
24 | Gagan Aggarwal, Rajeev Motwani 0001, Devavrat Shah, An Zhu |
Switch Scheduling via Randomized Edge Coloring. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
24 | Mustapha Kchikech, Olivier Togni |
Paths Coloring Algorithms in Mesh Networks. |
DMTCS |
2003 |
DBLP DOI BibTeX RDF |
|
24 | Ulrich Hirnschrott, Andreas Krall, Bernhard Scholz |
Graph Coloring vs. Optimal Register Allocation for Optimizing Compilers. |
JMLC |
2003 |
DBLP DOI BibTeX RDF |
|
24 | Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano, Anastasios Sidiropoulos |
Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees. |
WAOA |
2003 |
DBLP DOI BibTeX RDF |
|
24 | Subhash Khot |
Hardness Results for Coloring 3 -Colorable 3 -Uniform Hypergraphs. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Jirí Fiala 0001, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle |
Generalized H-Coloring and H-Covering of Trees. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Zdenek Dvorák 0001, Jan Kára, Daniel Král, Ondrej Pangrác |
Complexity of Pattern Coloring of Cycle Systems. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
Displaying result #301 - #400 of 5849 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ >>] |
|