Abstract
The conference offers a note of thanks and lists its reviewers.
2013 Computer Science and Information Technologies (CSIT)
Like what you’re reading?
Already a member?
Related Articles
- Coloring inductive graphs on-line
Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science - On the Dominator Colorings in Bipartite Graphs
2007 4th International Conference on Information Technology New Generations - Channel assignment on strongly-simplicial graphs
Parallel and Distributed Processing Symposium, International - On interval edge-colorings of bipartite graphs
2015 Computer Science and Information Technologies (CSIT) - A Fully Dynamic Distributed Algorithm for a B-Coloring of Graphs
2008 IEEE International Symposium on Parallel and Distributed Processing with Applications - Time-space lower bounds for directed s-t connectivity on JAG models
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science - Algorithms for Balanced Graph Colorings with Applications in Parallel Computing
IEEE Transactions on Parallel & Distributed Systems - Equitable Neighbor Sum Distinguishing Edge Colorings of Some Graphs
2017 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC) - Neighbor Sum Distinguishing Total Colorings of Graphs with Bounded Maximum Degree and Maximum Average Degree
2017 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC) - 1-Factorizations of Pseudorandom Graphs
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)