|
|
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 |
14 | Mayez A. Al-Mouhamed, Steven S. Seiden |
A Heuristic Storage for Minimizing Access Time of Arbitrary Data Patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 8(4), pp. 441-447, 1997. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings, pp. 727-737, 1997, Springer, 3-540-63165-8. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
14 | Mikkel Thorup |
Structured Programs have Small Tree-Width and Good Register Allocation (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings, pp. 318-332, 1997, Springer, 3-540-63757-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
14 | Klaus Jansen |
The Optimum Cost Chromatic Partition Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, Third Italian Conference, CIAC '97, Rome, Italy, March 12-14, 1997, Proceedings, pp. 25-36, 1997, Springer, 3-540-62592-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
14 | Wen-Jiin Tsai, Suh-Yin Lee |
Real-Time Scheduling of Multimedia Data Retrieval to Minimize Buffer Requirements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGOPS Oper. Syst. Rev. ![In: ACM SIGOPS Oper. Syst. Rev. 30(3), pp. 67-80, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
14 | Kent Cantwell |
Edge-Ramsey Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 15(3), pp. 341-352, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
14 | Andreas Nolte, Rainer Schrader |
Simulated Annealing and Its Problems to Color Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '96, Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996, Proceedings, pp. 138-151, 1996, Springer, 3-540-61680-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
14 | Jordan Gergov |
Approximation Algorithms for Dynamic Storage Allocations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '96, Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996, Proceedings, pp. 52-61, 1996, Springer, 3-540-61680-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13(7), pp. 843-856, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
14 | Shun-Shii Lin |
Constant-time algorithms for the channel assignment problem on processor arrays with reconfigurable bus systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13(7), pp. 884-890, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
14 | Jun Dong Cho, Salil Raje, Majid Sarrafzadeh |
Approximation Algorithm on Multi-Way Maxcut Partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '94, Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994, Proceedings, pp. 148-158, 1994, Springer, 3-540-58434-X. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
14 | Ton Kloks, Hans L. Bodlaender |
Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings, pp. 116-125, 1992, Springer, 3-540-56279-6. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
14 | Goos Kant, Jan van Leeuwen |
The File Distribution Problem for Processor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: SWAT 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 11-14, 1990, Proceedings, pp. 48-59, 1990, Springer, 3-540-52846-6. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
14 | Rong Lin, Stephan Olariu |
Fast Parallel Algorithms for Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Tenth Conference, Bangalore, India, December 17-19, 1990, Proceedings, pp. 176-189, 1990, Springer, 3-540-53487-3. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
14 | Peter Steenkiste, John L. Hennessy |
A Simple Interprocedural Register Allocation Algorithm and Its Effectiveness for Lisp. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 11(1), pp. 1-32, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
LISP |
14 | Wolfgang Gutjahr, Emo Welzl, Gerhard J. Woeginger |
Polynomial Graph-Colorings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 89, 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, February 16-18, 1989, Proceedings, pp. 108-119, 1989, Springer, 3-540-50840-6. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
14 | Rasiah Loganantharaj, Robert A. Mueller |
Parallel Theorem Proving with Connection Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 8th International Conference on Automated Deduction, Oxford, England, July 27 - August 1, 1986, Proceedings, pp. 337-352, 1986, Springer, 3-540-16780-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SUTC/UMC ![In: IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, SUTC 2010 and IEEE International Workshop on Ubiquitous and Mobile Computing, UMC 2010, 7-9 June 2010, Newport Beach, California, USA, pp. 89-94, 2010, IEEE Computer Society, 978-0-7695-4049-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: 2010 International Conference on Distributed Computing Systems, ICDCS 2010, Genova, Italy, June 21-25, 2010, pp. 718-727, 2010, IEEE Computer Society, 978-0-7695-4059-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCA ![In: 37th International Symposium on Computer Architecture (ISCA 2010), June 19-23, 2010, Saint-Malo, France, pp. 222-233, 2010, ACM, 978-1-4503-0053-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 2832-2844, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Coloring, Dominating sets, Independent sets, PTAS, Cliques, Unit-disk graphs |
12 | Robert Murphey |
Frequency Assignment Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 1097-1101, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Optimization, Graph coloring |
12 | David Eppstein |
Testing bipartiteness of geometric intersection graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 5(2), pp. 15:1-15:35, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 54(2), pp. 181-207, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 42(2), pp. 132-141, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings, pp. 211-222, 2009, Springer, 978-3-642-03815-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITNG ![In: Sixth International Conference on Information Technology: New Generations, ITNG 2009, Las Vegas, Nevada, USA, 27-29 April 2009, pp. 217-222, 2009, IEEE Computer Society, 978-0-7695-3596-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHI ![In: Proceedings of the 27th International Conference on Human Factors in Computing Systems, CHI 2009, Boston, MA, USA, April 4-9, 2009, pp. 1113-1116, 2009, ACM, 978-1-60558-246-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings, pp. 249-257, 2009, Springer, 978-3-642-02025-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NetCoM ![In: First International Conference on Networks and Communications, NetCoM 2009, Chennai, India, December 27-29, 2009, pp. 301-306, 2009, IEEE Computer Society, 978-0-7695-3924-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(1), pp. 11:1-11:20, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Sci. ![In: Math. Comput. Sci. 1(4), pp. 701-708, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 30(5), pp. 28:1-28:38, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
coloring, hierarchy, inheritance, layout, bidirectional |
12 | Roland Ducournau |
Perfect hashing as an almost perfect subtype test. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 30(6), pp. 33:1-33:56, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiHoc ![In: Proceedings of the 9th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008, pp. 149-158, 2008, ACM, 978-1-60558-073-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITNG ![In: Fifth International Conference on Information Technology: New Generations (ITNG 2008), 7-8 April 2008, Las Vegas, Nevada, USA, pp. 1192-1193, 2008, IEEE Computer Society, 978-0-7695-3099-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT 2008, 14th International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, Australia, December 7-11, 2008. Proceedings, pp. 37-53, 2008, Springer, 978-3-540-89254-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASES ![In: Proceedings of the 2008 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, CASES 2008, Atlanta, GA, USA, October 19-24, 2008, pp. 147-156, 2008, ACM. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings, pp. 185-197, 2008, Springer, 978-3-540-69900-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AINA ![In: 22nd International Conference on Advanced Information Networking and Applications, AINA 2008, GinoWan, Okinawa, Japan, March 25-28, 2008, pp. 56-63, 2008, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IIH-MSP ![In: 4th International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2008), Harbin, China, 15-17 August 2008, Proceedings, pp. 1301-1304, 2008, IEEE Computer Society, 978-0-7695-3278-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE SCC (2) ![In: 2008 IEEE International Conference on Services Computing (SCC 2008), 8-11 July 2008, Honolulu, Hawaii, USA, pp. 39-46, 2008, IEEE Computer Society, 978-0-7695-3283-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 14(1), pp. 9-33, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiHoc ![In: Proceedings of the 8th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2007, Montreal, Quebec, Canada, September 9-14, 2007, pp. 130-139, 2007, ACM, 978-1-59593-684-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACIS-ICIS ![In: 6th Annual IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007), 11-13 July 2007, Melbourne, Australia, pp. 885-890, 2007, IEEE Computer Society, 0-7695-2841-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007, pp. 194-195, 2007, ACM, 978-1-59593-667-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 22(2), pp. 261-269, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Vis. ![In: Int. J. Comput. Vis. 66(2), pp. 163-192, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSS ![In: Stabilization, Safety, and Security of Distributed Systems, 8th International Symposium, SSS 2006, Dallas, TX, USA, November 17-19, 2006, Proceedings, pp. 363-377, 2006, Springer, 978-3-540-49018-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiHoc ![In: Proceedings of the 7th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2006, Florence, Italy, May 22-25, 2006, pp. 322-333, 2006, ACM, 1-59593-368-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiCom ![In: Proceedings of the 12th Annual International Conference on Mobile Computing and Networking, MOBICOM 2006, Los Angeles, CA, USA, September 23-29, 2006, pp. 262-273, 2006, ACM, 1-59593-286-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, Arizona, USA, June 5-7, 2006, pp. 41-43, 2006, ACM, 1-59593-340-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised Papers, pp. 294-305, 2006, Springer, 978-3-540-70903-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
graph coloring, graph drawing, color space, color perception |
12 | Sanjeev Arora, Eden Chlamtac |
New approximation guarantee for chromatic number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 215-224, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 13(3), pp. 476-487, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 43(1-2), pp. 43-61, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 3(3), pp. 243-251, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 16(8), pp. 702-713, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 10(2), pp. 99-111, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiCom ![In: Proceedings of the 11th Annual International Conference on Mobile Computing and Networking, MOBICOM 2005, Cologne, Germany, August 28 - September 2, 2005, pp. 73-87, 2005, ACM, 1-59593-020-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Multimedia ![In: Proceedings of the 13th ACM International Conference on Multimedia, Singapore, November 6-11, 2005, pp. 351-354, 2005, ACM, 1-59593-044-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 18th International Conference on VLSI Design (VLSI Design 2005), with the 4th International Conference on Embedded Systems Design, 3-7 January 2005, Kolkata, India, pp. 736-741, 2005, IEEE Computer Society, 0-7695-2264-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: 4th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2005), July 25-29, 2005, Utrecht, The Netherlands, pp. 305-312, 2005, ACM, 1-59593-094-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
clustering, convergence, graph coloring, vehicle routing, emergent behavior |
12 | Xiao Zhou 0001, Takao Nishizeki |
Multicolorings of Series-Parallel Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 38(2), pp. 271-297, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 51(2), pp. 312-362, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(4), pp. 443-446, 2004. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(1), pp. 79-90, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Design Autom. Electr. Syst. ![In: ACM Trans. Design Autom. Electr. Syst. 9(2), pp. 212-237, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. VLSI Signal Process. ![In: J. VLSI Signal Process. 38(2), pp. 131-146, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS ![In: 10th International Conference on Parallel and Distributed Systems, ICPADS 2004, Newport Beach, CA, USA, July 7-9, 2004, pp. 73-80, 2004, IEEE Computer Society, 0-7695-2152-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 587-593, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 16(4), pp. 263-268, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 7(4), pp. 353-359, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego, California, USA (part of FCRC 2003), pp. 246-247, 2003, ACM, 1-58113-661-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: The Second International Joint Conference on Autonomous Agents & Multiagent Systems, AAMAS 2003, July 14-18, 2003, Melbourne, Victoria, Australia, Proceedings, pp. 950-951, 2003, ACM, 1-58113-683-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: The Second International Joint Conference on Autonomous Agents & Multiagent Systems, AAMAS 2003, July 14-18, 2003, Melbourne, Victoria, Australia, Proceedings, pp. 1158-1159, 2003, ACM, 1-58113-683-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 19(3), pp. 239-263, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 13(11), pp. 1124-1138, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Computer Graphics and Applications ![In: IEEE Computer Graphics and Applications 22(6), pp. 82-88, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS ![In: 35th Hawaii International Conference on System Sciences (HICSS-35 2002), CD-ROM / Abstracts Proceedings, 7-10 January 2002, Big Island, HI, USA, pp. 67, 2002, IEEE Computer Society, 0-7695-1435-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DELTA ![In: 1st IEEE International Workshop on Electronic Design, Test and Applications (DELTA 2002), 29-31 January 2002, Christchurch, New Zealand, pp. 392-395, 2002, IEEE Computer Society, 0-7695-1453-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 26(1), pp. 1-40, 2001. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Math. Softw. ![In: ACM Trans. Math. Softw. 26(1), pp. 150-175, 2000. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 26(1), pp. 3-30, 2000. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, January 9-11, 2000, San Francisco, CA, USA., pp. 155-164, 2000, ACM/SIAM, 0-89871-453-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM DL ![In: Proceedings of the Fifth ACM Conference on Digital Libraries, June 2-7, 2000, San Antonio, TX, USA, pp. 103-111, 2000, ACM. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 23(4), pp. 302-340, 1999. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: 1998 Design, Automation and Test in Europe (DATE '98), February 23-26, 1998, Le Palais des Congrès de Paris, Paris, France, pp. 830-834, 1998, IEEE Computer Society, 0-8186-8359-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 8(3), pp. 310-320, 1997. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 353-362, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1997 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1997, San Jose, CA, USA, November 9-13, 1997, pp. 104-107, 1997, IEEE Computer Society / ACM, 0-8186-8200-0. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings, pp. 203-212, 1996, Springer, 3-540-62048-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 44(9), pp. 1144-1149, 1995. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 1995 ACM symposium on applied computing, SAC'95, Nashville, TN, USA, February 26-28, 1995, pp. 123-129, 1995, ACM, 0-89791-658-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
cique separators, parallel register allocation, graph coloring |
12 | Sanjeev Mahajan, Ramesh Hariharan |
Derandomizing Semidefinite Programming Based Approximation Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 162-169, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 548-557, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 182-191, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(5), pp. 960-981, 1994. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 240-249, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 780-791, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
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 |
|
|