• Home
• Institute
• Departments
• News
  • Press Releases
  • Awards
  • Spotlight
  • Campus Event Calendar:
    • All Upcoming:
      • only for D1
      • only for D2
      • only for D3
      • only for D4
      • only for D5
      • only for RG1
      • only for MMCI
      • Mailing Lists
      • by Speaker
      • by Type
      • by Category
      • by Title
      • Calendar
      • RSS Feed
    • History of Events:
  • Employment
  • Information for Guests
• Location
• Publications
• Software
• People
• Services
• Library
• Doctoral Research Program
• Max Planck Center
• Cluster of Excellence (MMCI)
• Computer Science Cluster
• Sitemap

Campus Event Calendar : 4. Category

	Speaker			Event, Title, Topic	Building, Room	Event Type
Integer Programming
	Maximilian John			Dynamic Sparsification for Quadratic Assignment Problems	E1 4 024	AG1 Mittagsseminar (own work)
Keyboard Optimization
	Maximilian John			Dynamic Sparsification for Quadratic Assignment Problems	E1 4 024	AG1 Mittagsseminar (own work)
Linearization
	Maximilian John			Dynamic Sparsification for Quadratic Assignment Problems	E1 4 024	AG1 Mittagsseminar (own work)
Quadratic Assignment
	Maximilian John			Dynamic Sparsification for Quadratic Assignment Problems	E1 4 024	AG1 Mittagsseminar (own work)
(Not Categorized)
	Abhik Roychoudhury			Automated Program Repair	G26 [KL] 111	SWS Distinguished Lecture Series
	Bundit Laekhanukit			An O(log^2{k}/log log {k})-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm	E1 4 024	AG1 Mittagsseminar (own work)
	Guy Even			to be announced	E1 4 024	AG1 Mittagsseminar (own work)
	Khaled Elbassioni			Some Black-box Reductions for Cost-robust Discrete Optimization Problems	E1 4 024	AG1 Mittagsseminar (own work)
	Kurt Mehlhorn			D1 Group Meeting	E1 4 333	AG1 Group Meeting
	Kurt Mehlhorn			D1 Group Meeting	E1 4 333	AG1 Group Meeting
	Kurt Mehlhorn			D1 Group Meeting	E1 4 333	AG1 Group Meeting
	Kurt Mehlhorn			D1 Group Meeting	E1 4 333	AG1 Group Meeting
	Kurt Mehlhorn			D1 Group Meeting	E1 4 333	AG1 Group Meeting
	Kurt Mehlhorn			D1 Group Meeting	E1 4 333	AG1 Group Meeting
	Kurt Mehlhorn			D1 Group Meeting	E1 4 333	AG1 Group Meeting
	Kurt Mehlhorn			D1 Group Meeting	E1 4 333	AG1 Group Meeting
	Kurt Mehlhorn			D1 Group Meeting	E1 4 333	AG1 Group Meeting
	Kurt Mehlhorn			D1 Group Meeting	E1 4 333	AG1 Group Meeting
	Kurt Mehlhorn			D1 Group Meeting	E1 4 333	AG1 Group Meeting
	Kurt Mehlhorn			D1 Group Meeting	E1 4 333	AG1 Group Meeting
	Mario Fritz			The Bright and Dark Sides of Computer Vision: Challenges and Opportunities for Privacy and Security	E1 5 002	Joint Lecture Series
	Mirko			TBA	E1 4 024	AG1 Mittagsseminar (own work)
	Mirko			TBA	E1 4 024	AG1 Mittagsseminar (own work)
	Naveen Garg			A constant approximation algorithm for weighted flow time	E1 4 024	AG1 Mittagsseminar (own work)
	Pieter Kleer			The switch Markov chain for sampling graphs with given degrees	E1 4 024	AG1 Mittagsseminar (own work)
	Sandip Sinha			Local Decodability of the Burrows-Wheeler Transform	E1 4 024	AG1 Mittagsseminar (own work)
	Stefano Leucci			Tracking Routes in Communication Networks	E1 4 024	AG1 Mittagsseminar (own work)
	Themis Gouleakis			Communication and Memory Efficient Testing of Discrete Distributions	E1 4 024	AG1 Mittagsseminar (own work)

• Homepage
• About the Institute
• Departments
• News & Activities
  • Press Releases
  • Awards
  • Spotlight
  • Campus Events:
    • All Upcoming:
      • only for D1
      • only for D2
      • only for D3
      • only for D4
      • only for D5
      • only for RG1
      • only for MMCI
      • Mailing Lists
      • by Speaker
      • by Type
      • by Category
      • by Title
      • Calendar
      • RSS Feed
    • History of Events:
  • Information for Guests
• Location
• Publications
• Software
• People
• Services
• Library
• Graduate School (IMPRS-CS)
• Max Planck Center
• Cluster of Excellence (MMCI)
• Computer Science Cluster
• Sitemap