1![CS264: Homework #5 Due by midnight on Wednesday, October 29, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at http://rishig.sc CS264: Homework #5 Due by midnight on Wednesday, October 29, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at http://rishig.sc](https://www.pdfsearch.io/img/7d2d0fbdbb5a9840afe0755664b42fd4.jpg) | Add to Reading ListSource URL: theory.stanford.eduLanguage: English - Date: 2014-10-27 18:59:34
|
---|
2![Using Strong Triadic Closure to Characterize Ties in Social Networks Stavros Sintos Panayiotis Tsaparas Using Strong Triadic Closure to Characterize Ties in Social Networks Stavros Sintos Panayiotis Tsaparas](https://www.pdfsearch.io/img/edacad44fd727d15f4d0539f749c692e.jpg) | Add to Reading ListSource URL: www.cs.uoi.grLanguage: English - Date: 2014-09-25 06:28:22
|
---|
3![Microsoft Wordtext.nativedoc Microsoft Wordtext.nativedoc](https://www.pdfsearch.io/img/e4825b1376171f3d16718049fc9ad2e3.jpg) | Add to Reading ListSource URL: web.uvic.caLanguage: English - Date: 2012-11-03 03:43:42
|
---|
4![Algorithmica:385–414 DOIs00453Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs George B. Mertzios · Paul G. Spirakis Algorithmica:385–414 DOIs00453Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs George B. Mertzios · Paul G. Spirakis](https://www.pdfsearch.io/img/3d170c075222e1b289a0231723033767.jpg) | Add to Reading ListSource URL: community.dur.ac.ukLanguage: English - Date: 2016-01-12 16:30:06
|
---|
5![Journal of Complex Networks, 177–186 doi:comnet/cnv020 Advance Access publication on 21 July 2015 Network installation under convex costs Alexander Gutfraind† Journal of Complex Networks, 177–186 doi:comnet/cnv020 Advance Access publication on 21 July 2015 Network installation under convex costs Alexander Gutfraind†](https://www.pdfsearch.io/img/31492bffa0f1271dc0fbda8d46292924.jpg) | Add to Reading ListSource URL: www.levreyzin.comLanguage: English - Date: 2016-07-01 10:19:11
|
---|
6![Structural parameterizations for boxicity Henning Bruhn, Morgan Chopin, Felix Joos and Oliver Schaudt Abstract The boxicity of a graph G is the least integer d such that G has an intersection model of axis-aligned d-dime Structural parameterizations for boxicity Henning Bruhn, Morgan Chopin, Felix Joos and Oliver Schaudt Abstract The boxicity of a graph G is the least integer d such that G has an intersection model of axis-aligned d-dime](https://www.pdfsearch.io/img/3a89a9912116c364f314ea0072eb1bff.jpg) | Add to Reading ListSource URL: www.zaik.uni-koeln.deLanguage: English - Date: 2014-02-20 07:20:59
|
---|
7![Data Reduction, Exact, and Heuristic Algorithms for Clique Cover Jens Gramm Jiong Guo Data Reduction, Exact, and Heuristic Algorithms for Clique Cover Jens Gramm Jiong Guo](https://www.pdfsearch.io/img/6a15323a7255794d852c2f461c00c6d3.jpg) | Add to Reading ListSource URL: www.user.tu-berlin.deLanguage: English - Date: 2013-01-21 07:02:09
|
---|
8![](https://www.pdfsearch.io/img/49aff4b5c8d88bb0e9794bf8ea270f02.jpg) | Add to Reading ListSource URL: fpt.akt.tu-berlin.deLanguage: English - Date: 2014-10-07 11:22:31
|
---|
9![Vertex Cover Gets Faster and Harder on Low Degree Graphs Akanksha Agrawal1 , Sathish Govindarajan1 , Neeldhara Misra1 Indian Institute of Science, Bangalore {akanksha.agrawal|gsat|neeldhara}@csa.iisc.ernet.in Vertex Cover Gets Faster and Harder on Low Degree Graphs Akanksha Agrawal1 , Sathish Govindarajan1 , Neeldhara Misra1 Indian Institute of Science, Bangalore {akanksha.agrawal|gsat|neeldhara}@csa.iisc.ernet.in](https://www.pdfsearch.io/img/ecba0748b6167c69156388035d5834e8.jpg) | Add to Reading ListSource URL: drona.csa.iisc.ernet.inLanguage: English - Date: 2014-08-01 08:33:48
|
---|
10![CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic](https://www.pdfsearch.io/img/12f34795e384215f37625e11c25b5289.jpg) | Add to Reading ListSource URL: stanford.eduLanguage: English - Date: 2015-03-23 01:42:07
|
---|