default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSébastien Martin
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j31]Patrick Healy
, Nicolas Jozefowiez, Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka:
A branch-and-cut algorithm for the connected max-k-cut problem. Eur. J. Oper. Res. 312(1): 117-124 (2024)- [j30]Xabi Azagirre, Akshay Balwally, Guillaume Candeli, Nicholas Chamandy, Benjamin Han, Alona King, Hyungjun Lee, Martin Loncaric, Sébastien Martin, Vijay Narasiman, Zhiwei (Tony) Qin, Baptiste Richard, Sara Smoot, Sean Taylor, Garrett J. van Ryzin, Di Wu, Fei Yu, Alex Zamoshchin:
A Better Match for Drivers and Riders: Reinforcement Learning at Lyft. INFORMS J. Appl. Anal. 54(1): 71-83 (2024) - [j29]Ilan Lobel, Sébastien Martin, Haotian Song:
Frontiers in Operations: Employees vs. Contractors: An Operational Perspective. Manuf. Serv. Oper. Manag. 26(4): 1306-1322 (2024) - [j28]Rachid El Azouzi, Francesco De Pellegrini, Afaf Arfaoui, Cédric Richier, Jeremie Leguay, Quang-Trung Luu, Youcef Magnouche, Sébastien Martin:
Semi-Distributed Coflow Scheduling in Datacenters. IEEE Trans. Netw. Serv. Manag. 21(4): 4268-4281 (2024) - [j27]Paolo Medagliani, Sébastien Martin, Youcef Magnouche, Jérémie Leguay, Bruno Decraene:
Distributed Tactical TE With Segment Routing. IEEE Trans. Netw. Serv. Manag. 21(5): 4974-4987 (2024) - [c46]Youcef Magnouche, Sébastien Martin, Jeremie Leguay, Paolo Medagliani:
In-Band Network Telemetry for Efficient Congestion Mitigation. INOC 2024: 34-39 - [c45]Nicolas Huin, Sébastien Martin, Jérémie Leguay:
Virtual Multi-Topology Routing for QoS Constraints. NOMS 2024: 1-9 - [i15]Nicolas Huin, Sébastien Martin, Jérémie Leguay:
Virtual Multi-Topology Routing for QoS Constraints. CoRR abs/2401.04226 (2024) - [i14]Sébastien Martin, Youcef Magnouche, Paolo Medagliani, Jérémie Leguay:
Alternative paths computation for congestion mitigation in segment-routing networks. CoRR abs/2404.19314 (2024) - 2023
- [j26]Nicolas Huin, Jérémie Leguay, Sébastien Martin, Paolo Medagliani:
Routing and slot allocation in 5G hard slicing. Comput. Commun. 201: 72-90 (2023) - [j25]Aristide Grange, Imed Kacem, Sébastien Martin, Sarah Minich:
Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles. RAIRO Oper. Res. 57(1): 1-16 (2023) - [c44]Miguel Pineda Martín, Sébastien Martin:
Unsplittable Multi-Commodity Flow Problem via Quantum Computing. CoDIT 2023: 385-390 - [c43]Jiachen Zhang, Youcef Magnouche, Sébastien Martin, Antoine Fressancourt, J. Christopher Beck:
The Multi-Commodity Flow Problem with Disjoint Signaling Paths: A Branch-and-Benders-Cut Algorithm. CoDIT 2023: 477-482 - [c42]Mohamed Yassine Naghmouchi, Shoushou Ren, Paolo Medagliani, Sébastien Martin, Jérémie Leguay:
Optimal Admission Control in Damper-Based Networks: Branch-and-Price Algorithm. CoDIT 2023: 488-493 - [c41]Isma Bentoumi, Fabio Furini, Ali Ridha Mahjoub, Sébastien Martin:
A Branch-and-Benders-Cut Approach to Solve the Maximum Flow Blocker Problem. CoDIT 2023: 674-677 - [c40]Amal Benhamiche, Morgan Chopin, Sébastien Martin:
Unsplittable Shortest Path Routing: Extended Model and Matheuristic. CoDIT 2023: 926-931 - [c39]Roland Grappe, Mathieu Lacroix, Sébastien Martin:
The Multiple Pairs Shortest Path Problem for Sparse Graphs: Exact Algorithms. CoDIT 2023: 956-961 - [c38]Lirong Bai, Liang Zhang, Geng Zhang, Lin Zhang, Paolo Medagliani, Sébastien Martin:
A Distributed Congestion Mitigation Mechanism Based on Neighboring Nodes Traffic Steering. NoF 2023: 129-131 - [c37]Youcef Magnouche, Sébastien Martin, Jérémie Leguay:
Protected load-balancing problem: Neural-network based approximation for non-convex optimization. NOMS 2023: 1-9 - [i13]Youcef Magnouche, Sébastien Martin, Jérémie Leguay:
Protected load balancing problem: Neural-network based approximation for non-convex optimization. CoRR abs/2301.03645 (2023) - [i12]Francisco Castro, Jian Gao, Sébastien Martin:
Human-AI Interactions and Societal Pitfalls. CoRR abs/2309.10448 (2023) - [i11]Xabi Azagirre, Akshay Balwally, Guillaume Candeli, Nicholas Chamandy, Benjamin Han, Alona King, Hyungjun Lee, Martin Loncaric, Sébastien Martin, Vijay Narasiman, Zhiwei (Tony) Qin, Baptiste Richard, Sara Smoot, Sean Taylor, Garrett J. van Ryzin, Di Wu, Fei Yu, Alex Zamoshchin:
A Better Match for Drivers and Riders: Reinforcement Learning at Lyft. CoRR abs/2310.13810 (2023) - 2022
- [j24]Sébastien Martin, Youcef Magnouche, Corentin Juvigny, Jérémie Leguay:
Constrained shortest path tour problem: Branch-and-Price algorithm. Comput. Oper. Res. 144: 105819 (2022) - [j23]Varun Krishnan, Ramón Iglesias, Sébastien Martin, Su Wang, Varun Pattabhiraman, Garrett J. van Ryzin:
Solving the Ride-Sharing Productivity Paradox: Priority Dispatch and Optimal Priority Sets. INFORMS J. Appl. Anal. 52(5): 433-445 (2022) - [j22]Vincent Angilella, Filip Krasniqi, Paolo Medagliani, Sébastien Martin, Jérémie Leguay, Shoushou Ren, Xuan Liu:
High Capacity and Resilient Large-Scale Deterministic IP Networks. J. Netw. Syst. Manag. 30(4): 71 (2022) - [c36]Mohamed Yassine Naghmouchi, Shoushou Ren, Paolo Medagliani, Sébastien Martin, Jérémie Leguay:
Scalable Damper-based Deterministic Networking. CNSM 2022: 367-373 - [c35]Pham Tran Anh Quang, Sébastien Martin, Jérémie Leguay, Xu Gong, Huiying Xu:
Intent-Based Routing Policy Optimization in SD-WAN. ICC 2022: 4914-4919 - [c34]Paolo Medagliani, Sébastien Martin, Jérémie Leguay, Shengming Cai, Feng Zeng, Nicolas Huin:
Resource Defragmentation for Network Slicing. INFOCOM Workshops 2022: 1-2 - [c33]Youcef Magnouche, Sébastien Martin, Jérémie Leguay, Francesco De Pellegrini, Rachid Elazouzi, Cédric Richier:
Branch-and-Benders-Cut Algorithm for the Weighted Coflow Completion Time Minimization Problem. INOC 2022: 1-6 - [c32]Benjamin Han, Hyungjun Lee, Sébastien Martin:
Real-Time Rideshare Driver Supply Values Using Online Reinforcement Learning. KDD 2022: 2968-2976 - [i10]Sébastien Martin:
A Feasibility Study on Real-Time High Resolution Imaging of the Brain Using Electrical Impedance Tomography. CoRR abs/2202.13159 (2022) - [i9]Sébastien Martin:
A Post-Processing Tool and Feasibility Study for Three-Dimensional Imaging with Electrical Impedance Tomography During Deep Brain Stimulation Surgery. CoRR abs/2204.05201 (2022) - [i8]Mohamed Yassine Naghmouchi, Shoushou Ren, Paolo Medagliani, Sébastien Martin, Jérémie Leguay:
Scalable Damper-based Deterministic Networking. CoRR abs/2209.12052 (2022) - 2021
- [j21]Jonatan Krolikowski, Sébastien Martin, Paolo Medagliani, Jérémie Leguay, Shuang Chen, Xiaodong Chang, Xuesong Geng:
Joint routing and scheduling for large-scale deterministic IP networks. Comput. Commun. 165: 33-42 (2021) - [j20]Youcef Magnouche, Ali Ridha Mahjoub, Sébastien Martin:
The multi-terminal vertex separator problem: Branch-and-Cut-and-Price. Discret. Appl. Math. 290: 86-111 (2021) - [j19]Matthias Becker, Nicolas Ginoux, Sébastien Martin, Zsuzsanna Róka:
Tire noise optimization problem: a mixed integer linear programming approach. RAIRO Oper. Res. 55(5): 3073-3085 (2021) - [c31]Sébastien Martin, Paolo Medagliani, Jeremie Leguay:
Network Slicing for Deterministic Latency. CNSM 2021: 572-577 - [c30]Aristide Grange, Imed Kacem, Sébastien Martin, Sarah Minich:
Approximate solutions for a special pagination problem with 2 symbols per tile. ICNSC 2021: 1-4 - [c29]Nicolas Huin, Sébastien Martin, Jérémie Leguay, Shengming Cai:
Network Slicing with Multi-Topology Routing. Networking 2021: 1-2 - [c28]Bingyang Liu, Shoushou Ren, Chuang Wang, Vincent Angilella, Paolo Medagliani, Sébastien Martin, Jeremie Leguay:
Towards Large-Scale Deterministic IP Networks. Networking 2021: 1-9 - [c27]Pham Tran Anh Quang, Sébastien Martin, Jérémie Leguay, Xu Gong, Feng Zeng:
Intent-based policy optimization in SD-WAN. SIGCOMM Posters and Demos 2021: 74-75 - 2020
- [j18]Pierre Laroche, Franc Marchetti, Sébastien Martin, Anass Nagih, Zsuzsanna Róka:
Multiple Bipartite Complete Matching Vertex Blocker Problem: Complexity, polyhedral analysis and Branch-and-Cut. Discret. Optim. 35: 100551 (2020) - [j17]Dimitris Bertsimas, Arthur Delarue, William Eger, John Hanlon, Sébastien Martin:
Bus Routing Optimization Helps Boston Public Schools Design Better Policies. INFORMS J. Appl. Anal. 50(1): 37-49 (2020) - [j16]Youcef Magnouche, Sébastien Martin:
Most vital vertices for the shortest s-t path problem: complexity and Branch-and-Cut algorithm. Optim. Lett. 14(8): 2039-2053 (2020) - [c26]Patrick Healy, Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka:
Exact and Heuristic Solutions to the Connected k-Partitioning Problem. CoDIT 2020: 1127-1132 - [c25]Shuang Chen, Jérémie Leguay, Sébastien Martin, Paolo Medagliani:
Load Balancing for Deterministic Networks. Networking 2020: 785-790 - [c24]Arnaud Verdant, William Guicquero, Nicolas Royer, Guillaume Moritz, Sébastien Martin, Florent Lepin, Sylvain Choisnet, Fabrice Guellec, Benoît Deschamps, Sylvain Clerc, Jérôme Chossat:
A 3.0μW@5fps QQVGA Self-Controlled Wake-Up Imager with On-Chip Motion Detection, Auto-Exposure and Object Recognition. VLSI Circuits 2020: 1-2 - [i7]Jonatan Krolikowski, Sébastien Martin, Paolo Medagliani, Jeremie Leguay, Shuang Chen, Xiaodong Chang, Xuesong Geng:
Joint Routing and Scheduling for Large-Scale Deterministic IP Networks. CoRR abs/2004.02717 (2020)
2010 – 2019
- 2019
- [j15]Denis Cornaz, Youcef Magnouche, Ali Ridha Mahjoub, Sébastien Martin:
The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut. Discret. Appl. Math. 256: 11-37 (2019) - [j14]Denis Cornaz, Fabio Furini, Mathieu Lacroix, Enrico Malaguti, Ali Ridha Mahjoub, Sébastien Martin:
The vertex k-cut problem. Discret. Optim. 31: 8-28 (2019) - [j13]Fabio Furini, Ivana Ljubic, Sébastien Martin, Pablo San Segundo:
The maximum clique interdiction problem. Eur. J. Oper. Res. 277(1): 112-127 (2019) - [j12]Dimitris Bertsimas, Patrick Jaillet, Sébastien Martin:
Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications. Oper. Res. 67(1): 143-162 (2019) - [j11]Dimitris Bertsimas, Arthur Delarue, Patrick Jaillet, Sébastien Martin:
Travel Time Estimation in the Age of Big Data. Oper. Res. 67(2): 498-515 (2019) - [j10]Dimitris Bertsimas, Arthur Delarue, Sébastien Martin:
Optimizing schools' start time and bus routes. Proc. Natl. Acad. Sci. USA 116(13): 5943-5948 (2019) - [c23]Nicolas Huin, Paolo Medagliani, Sébastien Martin, Jérémie Leguay, Lei Shi, Shengming Cai, Jinchun Xu, Hao Shi:
Hard-isolation for Network Slicing. INFOCOM Workshops 2019: 955-956 - [c22]Nicolas Huin, Jérémie Leguay, Sébastien Martin, Paolo Medagliani, Shengmin Cai:
Routing and Slot Allocation in 5G Hard Slicing. INOC 2019: 72-77 - [i6]Dimitris Bertsimas, Arthur Delarue, Patrick Jaillet, Sébastien Martin:
The Price of Interpretability. CoRR abs/1907.03419 (2019) - [i5]Dimitris Bertsimas, Arthur Delarue, Patrick Jaillet, Sébastien Martin:
Optimal Explanations of Linear Models. CoRR abs/1907.04669 (2019) - 2018
- [j9]Aristide Grange, Imed Kacem, Sébastien Martin:
Algorithms for the bin packing problem with overlapping items. Comput. Ind. Eng. 115: 331-341 (2018) - [j8]Fabio Furini, Enrico Malaguti, Sébastien Martin, Ian-Christopher Ternier:
ILP Models and Column Generation for the Minimum Sum Coloring Problem. Electron. Notes Discret. Math. 64: 215-224 (2018) - [j7]Mohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem, Sébastien Martin, Izzeldin M. Osman:
On the m-clique free interval subgraphs polytope: polyhedral analysis and applications. J. Comb. Optim. 36(3): 1074-1101 (2018) - [j6]Silvia Bertoluzza, Astrid Decoene, Loïc Lacouture, Sébastien Martin:
Local error analysis for the Stokes equations with a punctual source term. Numerische Mathematik 140(3): 677-701 (2018) - [c21]Laurent Millet, Margaux Vigier, Gilles Sicard, Wilfried Uhring, Nils Margotat, Fabrice Guellec, Sébastien Martin:
A 5 Million Frames Per Second 3D Stacked Image Sensor With In-Pixel Digital Storage. ESSCIRC 2018: 62-65 - [c20]Slim Turki, Sébastien Martin, Samuel Renault:
BE-GOOD: open data for a smarter society. ICEGOV 2018: 704-705 - [i4]Matthias Becker, Nicolas Ginoux, Sébastien Martin, Zsuzsanna Róka:
Tire Noise Optimization Problem: a Mixed Integer Linear Program Approach. CoRR abs/1809.05058 (2018) - 2017
- [c19]Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka:
Bipartite complete matching vertex interdiction problem with incompatibility constraints: Complexity and heuristics. CoDIT 2017: 6-11 - [c18]Mohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem, Sébastien Martin, Izzeldin M. Osman:
Mathematical formulation for open shop scheduling problem. CoDIT 2017: 803-808 - [c17]Sébastien Martin, Slim Turki, Samuel Renault:
Open Data Ecosystems - Introducing the Stimulator Function. EGOVIS 2017: 49-63 - [c16]Laurent Alacoque, Sébastien Martin, Wilfried Rabaud, Edith Beigné, Antoine Dupret, Bertrand Dupont:
A 128x128, 34μm pitch, 8.9mW, 190mK NETD, TECless Uncooled IR bolometer image sensor with column-wise processing. IMSE 2017: 68-73 - 2016
- [c15]Mohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem, Sébastien Martin, Izzeldin M. Osman:
Valid inequalities for unrelated parallel machines scheduling with precedence constraints. CoDIT 2016: 677-682 - [c14]Youcef Magnouche, Ali Ridha Mahjoub, Sébastien Martin:
The multi-terminal vertex separator problem: Extended formulations and Branch-and-Cut-and-Price. CoDIT 2016: 683-688 - [c13]Mohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem, Sébastien Martin, Izzeldin M. Osman:
Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut. ISCO 2016: 308-319 - [c12]Youcef Magnouche, Sébastien Martin:
The Multi-terminal Vertex Separator Problem: Polytope Characterization and TDI-ness. ISCO 2016: 320-331 - [c11]Matthias Becker, Nicolas Ginoux, Sébastien Martin, Zsuzsanna Róka:
Optimization of tire noise by solving an Integer Linear Program (ILP). SMC 2016: 1591-1596 - [i3]Aristide Grange, Imed Kacem, Sébastien Martin:
Algorithms for the Pagination Problem, a Bin Packing with Overlapping Items. CoRR abs/1605.00558 (2016) - 2014
- [c10]Mohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem, Sébastien Martin:
Unrelated parallel machines with precedence constraints: application to cloud computing. CloudNet 2014: 438-442 - [c9]Denis Cornaz, Fabio Furini, Mathieu Lacroix, Enrico Malaguti, Ali Ridha Mahjoub, Sébastien Martin:
Mathematical formulations for the Balanced Vertex k-Separator Problem. CoDIT 2014: 176-181 - [c8]Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka:
Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse Assignment. CoDIT 2014: 182-187 - [c7]Muriel Foulonneau, Sébastien Martin, Slim Turki:
How Open Data Are Turned into Services? IESS 2014: 31-39 - 2013
- [c6]Sébastien Martin, Muriel Foulonneau, Slim Turki:
1-5 Stars: Metadata on the Openness Level of Open Data Sets in Europe. MTSR 2013: 234-245 - 2012
- [j5]Laurent Chupin, Sébastien Martin:
Rigorous Derivation of the Thin Film Approximation with Roughness-Induced Correctors. SIAM J. Math. Anal. 44(4): 3041-3070 (2012) - [j4]Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin, Christophe Picouleau:
On the NP-completeness of the perfect matching free subgraph problem. Theor. Comput. Sci. 423: 25-29 (2012) - [c5]Fabrice Guellec, Sébastien Dubois, Eric de Borniol, Pierre Castelein, Sébastien Martin, Romain Guiguet, Michaël Tchagaspanian, Anne Rouvié, Philippe Bois:
A low-noise 15-μm pixel-pitch 640×512 hybrid InGaAs image sensor for night vision. Sensors, Cameras, and Systems for Industrial and Scientific Applications 2012: 82980C - [c4]Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin:
Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem. ISCO 2012: 117-128 - 2011
- [j3]Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin:
Combinatorial optimization model and MIP formulation for the structural analysis of conditional differential-algebraic systems. Comput. Ind. Eng. 61(2): 422-429 (2011) - [i2]Michael Baumann, Michel Bolla, Vincent Daanen, Jean-Luc Descotes, Jean-Yves Giraud, Nikolai Hungr, Antoine Leroy, Jean-Alexandre Long, Sébastien Martin, Jocelyne Troccaz:
Prosper: image and robot-guided prostate brachytherapy. CoRR abs/1104.1506 (2011) - 2010
- [j2]Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin:
Structural Analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets. Electron. Notes Discret. Math. 36: 1073-1080 (2010) - [c3]Sébastien Martin, Michael Baumann, Vincent Daanen, Jocelyne Troccaz:
MR prior based automatic segmentation of the prostate in TRUS images for MR/TRUS data fusion. ISBI 2010: 640-643
2000 – 2009
- 2008
- [b1]Sébastien Martin:
Utilisation d'atlas anatomiques et de modèles déformables pour la segmentation de la prostate en IRM. (Segmentation of Prostate MRI using Probabilistic Atlas and Deformable Model). Joseph Fourier University, Grenoble, France, 2008 - [j1]Sébastien Martin, Vincent Daanen, Jocelyne Troccaz:
Atlas-based prostate segmentation using an hybrid registration. Int. J. Comput. Assist. Radiol. Surg. 3(6): 485-492 (2008) - [i1]Sébastien Martin, Vincent Daanen, Jocelyne Troccaz:
Atlas-Based Prostate Segmentation Using an Hybrid Registration. CoRR abs/0806.3708 (2008) - 2006
- [c2]Sébastien Martin, Vincent Daanen, Olivier Chavanon, Jocelyne Troccaz:
Fast Segmentation of the Mitral Valve Leaflet in Echocardiography. CVAMIA 2006: 225-235 - [c1]Sébastien Martin, Vincent Daanen, Jocelyne Troccaz, Olivier Chavanon:
Tracking of the mitral valve leaflet in echocardiography images. ISBI 2006: 181-184
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-11-07 21:29 CET 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:
