Search Results for - Narrowed by: Jansen, Klaus. editor. - E-Book - Electronic Library - Computational complexity. - Computer science. - Data structures (Computer science).
SirsiDynix Enterprise
https://katalog.hacettepe.edu.tr/client/en_US/default/default/qf$003dAUTHOR$002509Author$002509Jansen$00252C$002bKlaus.$002beditor.$002509Jansen$00252C$002bKlaus.$002beditor.$0026qf$003dITYPE$002509Material$002bType$0025091$00253AE-KITAP$002509E-Book$0026qf$003dLOCATION$002509Shelf$002bLocation$0025091$00253AELEKKUTUPH$002509Electronic$002bLibrary$0026qf$003dSUBJECT$002509Subject$002509Computational$002bcomplexity.$002509Computational$002bcomplexity.$0026qf$003dSUBJECT$002509Subject$002509Computer$002bscience.$002509Computer$002bscience.$0026qf$003dSUBJECT$002509Subject$002509Data$002bstructures$002b$002528Computer$002bscience$002529.$002509Data$002bstructures$002b$002528Computer$002bscience$002529.$0026te$003dILS$0026rt$003dfalse$00257C$00257C$00257CISBN$00257C$00257C$00257CISBN$0026ps$003d300?
2024-08-28T21:31:33Z
Graph-Theoretic Concepts in Computer Science 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers
ent://SD_ILS/0/SD_ILS:335182
2024-08-28T21:31:33Z
2024-08-28T21:31:33Z
Author Brandstädt, Andreas. editor. Jansen, Klaus. editor. Reischuk, Rüdiger. editor. SpringerLink (Online service)<br/>Preferred Shelf Number ONLINE(335182.1)<br/>Electronic Access <a href="http://dx.doi.org/10.1007/978-3-642-45043-3">http://dx.doi.org/10.1007/978-3-642-45043-3</a><br/>Format: Electronic Resources<br/>Availability Online Library~1<br/>
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings
ent://SD_ILS/0/SD_ILS:334929
2024-08-28T21:31:33Z
2024-08-28T21:31:33Z
Author Raghavendra, Prasad. editor. Raskhodnikova, Sofya. editor. Jansen, Klaus. editor. Rolim, José D. P. editor. SpringerLink (Online service)<br/>Preferred Shelf Number ONLINE(334929.1)<br/>Electronic Access <a href="http://dx.doi.org/10.1007/978-3-642-40328-6">http://dx.doi.org/10.1007/978-3-642-40328-6</a><br/>Format: Electronic Resources<br/>Availability Online Library~1<br/>
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings
ent://SD_ILS/0/SD_ILS:195186
2024-08-28T21:31:33Z
2024-08-28T21:31:33Z
Author Goldberg, Leslie Ann. editor. Jansen, Klaus. editor. Ravi, R. editor. Rolim, José D. P. editor. SpringerLink (Online service)<br/>Preferred Shelf Number ONLINE<br/>Electronic Access <a href="http://dx.doi.org/10.1007/978-3-642-22935-0">http://dx.doi.org/10.1007/978-3-642-22935-0</a><br/>Format: Electronic Resources<br/>Availability Online Library~1<br/>
Approximation and Online Algorithms 7th International Workshop,WAOA 2009, Copenhagen Denmark, September 10-11, 2009. Revised Papers
ent://SD_ILS/0/SD_ILS:192001
2024-08-28T21:31:33Z
2024-08-28T21:31:33Z
Author Bampis, Evripidis. editor. Jansen, Klaus. editor. SpringerLink (Online service)<br/>Preferred Shelf Number ONLINE<br/>Electronic Access <a href="http://dx.doi.org/10.1007/978-3-642-12450-1">http://dx.doi.org/10.1007/978-3-642-12450-1</a><br/>Format: Electronic Resources<br/>Availability Online Library~1<br/>
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings
ent://SD_ILS/0/SD_ILS:192947
2024-08-28T21:31:33Z
2024-08-28T21:31:33Z
Author Serna, Maria. editor. Shaltiel, Ronen. editor. Jansen, Klaus. editor. Rolim, José. editor. SpringerLink (Online service)<br/>Preferred Shelf Number ONLINE<br/>Electronic Access <a href="http://dx.doi.org/10.1007/978-3-642-15369-3">http://dx.doi.org/10.1007/978-3-642-15369-3</a><br/>Format: Electronic Resources<br/>Availability Online Library~1<br/>