default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarc Nunkesser
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c11]Austin Derrow-Pinion, Jennifer She, David Wong, Oliver Lange, Todd Hester, Luis Perez, Marc Nunkesser, Seongjae Lee, Xueying Guo, Brett Wiltshire, Peter W. Battaglia, Vishal Gupta, Ang Li, Zhongwen Xu, Alvaro Sanchez-Gonzalez, Yujia Li, Petar Velickovic:
ETA Prediction with Graph Neural Networks in Google Maps. CIKM 2021: 3767-3776- [i4]Austin Derrow-Pinion, Jennifer She, David Wong, Oliver Lange, Todd Hester, Luis Perez, Marc Nunkesser, Seongjae Lee, Xueying Guo, Brett Wiltshire, Peter W. Battaglia, Vishal Gupta, Ang Li, Zhongwen Xu, Alvaro Sanchez-Gonzalez, Yujia Li, Petar Velickovic:
ETA Prediction with Graph Neural Networks in Google Maps. CoRR abs/2108.11482 (2021) - [i3]Neha Arora, Theophile Cabannes, Sanjay Ganapathy, Yechen Li, Preston McAfee, Marc Nunkesser, Carolina Osorio, Andrew Tomkins, Iveel Tsogsuren:
Quantifying the sustainability impact of Google Maps: A case study of Salt Lake City. CoRR abs/2111.03426 (2021)
2010 – 2019
- 2013
- [c10]Stefan Heule, Marc Nunkesser, Alexander Hall:
HyperLogLog in practice: algorithmic engineering of a state of the art cardinality estimation algorithm. EDBT 2013: 683-692 - 2012
- [j6]Marco Casazza
, Alberto Ceselli, Marc Nunkesser:
Efficient algorithms for the double traveling salesman problem with multiple stacks. Comput. Oper. Res. 39(5): 1044-1053 (2012) - [j5]Alexander Hall, Olaf Bachmann, Robert Büssow, Silviu Ganceanu, Marc Nunkesser:
Processing a Trillion Cells per Mouse Click. Proc. VLDB Endow. 5(11): 1436-1446 (2012) - [i2]Alexander Hall, Olaf Bachmann, Robert Büssow, Silviu Ganceanu, Marc Nunkesser:
Processing a Trillion Cells per Mouse Click. CoRR abs/1208.0225 (2012) - 2011
- [j4]Riko Jacob, Peter Márton, Jens Maue, Marc Nunkesser:
Multistage methods for freight train classification. Networks 57(1): 87-105 (2011)
2000 – 2009
- 2009
- [c9]Peter Márton, Jens Maue, Marc Nunkesser:
An Improved Train Classification Procedure for the Hump Yard Lausanne Triage. ATMOS 2009 - [c8]Marco Casazza, Alberto Ceselli, Marc Nunkesser:
Efficient Algorithms for the Double Traveling Salesman Problem with Multiple Stacks. CTW 2009: 7-10 - [c7]Holger Flier, Thomas Graffagnino, Marc Nunkesser:
Scheduling Additional Trains on Dense Corridors. SEA 2009: 149-160 - [p1]Holger Flier, Rati Gelashvili, Thomas Graffagnino, Marc Nunkesser:
Mining Railway Delay Dependencies in Large-Scale Real-World Delay Data. Robust and Online Large-Scale Optimization 2009: 354-368 - 2008
- [j3]Mark Cieliebak, Alexander Hall, Riko Jacob, Marc Nunkesser:
Sequential vector packing. Theor. Comput. Sci. 409(3): 351-363 (2008) - [j2]Alberto Ceselli, Michael Gatto, Marco E. Lübbecke, Marc Nunkesser, Heiko Schilling:
Optimizing the Cargo Express Service of Swiss Federal Railways. Transp. Sci. 42(4): 450-465 (2008) - [i1]Gabrio Caimi, Holger Flier, Martin Fuchsberger, Marc Nunkesser:
Performance of a greedy algorithm for edge covering by cliques in interval graphs. CoRR abs/0812.2115 (2008) - 2007
- [j1]Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer:
An Algorithmic View on OVSF Code Assignment. Algorithmica 47(3): 269-298 (2007) - [c6]Riko Jacob, Peter Márton, Jens Maue, Marc Nunkesser:
Multistage Methods for Freight Train Classification. ATMOS 2007 - [c5]Mark Cieliebak, Alexander Hall, Riko Jacob, Marc Nunkesser:
Sequential Vector Packing. ESCAPE 2007: 12-23 - [e1]Juraj Hromkovic, Richard Královic, Marc Nunkesser, Peter Widmayer:
Stochastic Algorithms: Foundations and Applications, 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings. Lecture Notes in Computer Science 4665, Springer 2007, ISBN 978-3-540-74870-0 [contents] - 2006
- [b1]Marc Nunkesser:
Algorithm design and analysis of problems in manufacturing, logistic, and telecommunications: An algorithmic jam session. ETH Zurich, Zürich, Switzerland, 2006 - [c4]Christoph Ambühl, Thomas Erlebach, Matús Mihalák, Marc Nunkesser:
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs. APPROX-RANDOM 2006: 3-14 - 2004
- [c3]Marc Nunkesser, Daniel Sawitzki:
Blockmodels. Network Analysis 2004: 253-292 - [c2]Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer:
An Algorithmic View on OVSF Code Assignment. STACS 2004: 270-281 - [c1]Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer:
Joint Base Station Scheduling. WAOA 2004: 225-238
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
