default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Aleksandrov
Person information
- affiliation: Free University Berlin, Germany
- affiliation (PhD 2018): University of New South Wales, Sydney, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c29]Martin Aleksandrov:
Learning Demands for Ride-pooling Services: A Case Study in Berlin. IV 2024: 2995-3000- 2023
- [c28]Martin D. Aleksandrov:
Limiting Inequalities in Fair Division with Additive Value Preferences for Indivisible Social Items. AAAI Spring Symposium: SRAI 2023: 32-39 - [c27]Martin Aleksandrov
:
Limiting Inequalities in Repeated House and Task Allocation. AI (2) 2023: 338-349 - [c26]Martin Aleksandrov, Tobias Labarta:
Safety, Stability, and Efficiency of Taxi Rides. EPIA (2) 2023: 401-412 - [c25]Tiago Barros, Luís Garrote, Martin Aleksandrov, Cristiano Premebida, Urbano J. Nunes:
TReR: A Lightweight Transformer Re-Ranking Approach for 3D LiDAR Place Recognition. ITSC 2023: 2843-2849 - [i16]Tiago Barros, Luís Garrote, Martin Aleksandrov, Cristiano Premebida, Urbano J. Nunes:
TReR: A Lightweight Transformer Re-Ranking Approach for 3D LiDAR Place Recognition. CoRR abs/2305.18013 (2023) - 2022
- [c24]Martin Aleksandrov:
Fairness for Drivers with Additive Profits in Emerging Vehicle Routing Problems. AAAI Spring Symposium: HFIF 2022: 55 - [c23]Martin Damyanov Aleksandrov:
Dynamic Fleet Management and Household Feedback for Garbage Collection. AIES 2022: 36-45 - [c22]Martin Aleksandrov, Philip Kilby:
Efficiency and Truthfulness in Dial-a-Ride Problems with Customers Location Preferences. AI 2022: 690-703 - [c21]Martin Aleksandrov:
Driver Equitability and Customer Optimality in Intelligent Vehicle Applications. EPIA 2022: 309-321 - [c20]Martin Aleksandrov:
Envy Freeness Up to One Item: Shall We Duplicate or Remove Resources? EPIA 2022: 727-738 - [c19]Martin Damyanov Aleksandrov, Khaled Alomari:
Fuel Efficiency of Garbage Truck Navigation. GCAIoT 2022: 100-107 - [c18]Martin Damyanov Aleksandrov:
Fair Division meets Vehicle Routing: Fairness for Drivers with Monotone Profits. IV 2022: 915-920 - [c17]Martin Damyanov Aleksandrov:
Manipulating Waiting-Plus-Detour-Time Mechanisms for Pickup and Delivery Problems. OR 2022: 443-449 - [i15]Martin Damyanov Aleksandrov:
Fair Division meets Vehicle Routing: Fairness for Drivers with Monotone Profits. CoRR abs/2208.07094 (2022) - 2021
- [c16]Martin Damyanov Aleksandrov:
Minimising Fleet Times in Multi-depot Pickup and Dropoff Problems. EPIA 2021: 199-210 - [c15]Martin Damyanov Aleksandrov:
Fleet Fairness and Fleet Efficiency in Capacitated Pickup and Delivery Problems. IV 2021: 1156-1161 - [c14]Martin Damyanov Aleksandrov:
Intelligent household waste collection. BuildSys@SenSys 2021: 298-301 - 2020
- [c13]Martin Aleksandrov, Toby Walsh:
Online Fair Division: A Survey. AAAI 2020: 13557-13562 - [c12]Martin Aleksandrov, Toby Walsh:
Two Algorithms for Additive and Fair Division of Mixed Manna. KI 2020: 3-17 - [i14]Martin Aleksandrov:
Jealousy-freeness and other common properties in Fair Division of Mixed Manna. CoRR abs/2004.11469 (2020) - [i13]Martin Aleksandrov:
Envy-freeness up to one item: Shall we add or remove resources? CoRR abs/2006.11312 (2020) - [i12]Martin Aleksandrov, Toby Walsh:
Monotone and Online Fair Division. CoRR abs/2006.15891 (2020) - [i11]Martin Aleksandrov, Toby Walsh:
Group Envy Freeness and Group Pareto Efficiency in Fair Division with Indivisible Items. CoRR abs/2006.15893 (2020) - [i10]Martin Aleksandrov, Toby Walsh:
Strategy-proofness, Envy-freeness and Pareto efficiency in Online Fair Division with Additive Utilities. CoRR abs/2006.15900 (2020) - [i9]Martin Aleksandrov, Toby Walsh:
Expected Outcomes and Manipulations in Online Fair Division. CoRR abs/2006.15905 (2020) - [i8]Martin Aleksandrov, Toby Walsh:
Most Competitive Mechanisms in Online Fair Division. CoRR abs/2006.15909 (2020) - [i7]Martin Aleksandrov, Toby Walsh:
Two Algorithms for Additive and Fair Division of Mixed Manna. CoRR abs/2007.04129 (2020)
2010 – 2019
- 2019
- [c11]Martin Aleksandrov, Cunjing Ge, Toby Walsh:
Fair Division Minimizing Inequality. EPIA (2) 2019: 593-605 - [c10]Martin Aleksandrov, Toby Walsh:
Monotone and Online Fair Division. KI 2019: 60-75 - [c9]Martin Aleksandrov, Toby Walsh:
Strategy-Proofness, Envy-Freeness and Pareto Efficiency in Online Fair Division with Additive Utilities. PRICAI (1) 2019: 527-541 - [i6]Martin Aleksandrov, Toby Walsh:
Online Fair Division: A Survey. CoRR abs/1911.09488 (2019) - [i5]Martin Aleksandrov, Toby Walsh:
Greedy Algorithms for Fair Division of Mixed Manna. CoRR abs/1911.11005 (2019) - 2018
- [b1]Martin Aleksandrov:
Online Fair Division with Indivisible Items. University of New South Wales, Sydney, Australia, 2018 - [c8]Martin Aleksandrov, Toby Walsh:
Group Envy Freeness and Group Pareto Efficiency in Fair Division with Indivisible Items. KI 2018: 57-72 - [i4]Martin Aleksandrov:
Almost Envy Freeness and Welfare Efficiency in Fair Division with Goods or Bads. CoRR abs/1808.00422 (2018) - [i3]Martin Aleksandrov, Cunjing Ge, Toby Walsh:
Fair Division Minimizing Inequality. CoRR abs/1810.04259 (2018) - 2017
- [c7]Martin Aleksandrov, Toby Walsh:
Pure Nash Equilibria in Online Fair Division. IJCAI 2017: 42-48 - [c6]Martin Aleksandrov, Toby Walsh:
Expected Outcomes and Manipulations in Online Fair Division. KI 2017: 29-43 - [c5]Martin Aleksandrov, Toby Walsh:
Most Competitive Mechanisms in Online Fair Division. KI 2017: 44-57 - [i2]Martin Aleksandrov:
Sustainable Fair Division. CoRR abs/1702.05825 (2017) - 2016
- [c4]Martin Aleksandrov:
Online Fair Division Redux. IJCAI 2016: 3970-3971 - 2015
- [c3]Martin Aleksandrov, Haris Aziz, Serge Gaspers, Toby Walsh:
Online Fair Division: Analysing a Food Bank Problem. IJCAI 2015: 2540-2546 - [c2]Martin Aleksandrov:
Online Fair Division. IJCAI 2015: 4339-4340 - [i1]Martin Aleksandrov, Haris Aziz, Serge Gaspers, Toby Walsh:
Online Fair Division: analysing a Food Bank problem. CoRR abs/1502.07571 (2015) - 2012
- [c1]Martin Aleksandrov, Carlo Strapparava:
NgramQuery - Smart Information Extraction from Google N-gram using External Resources. LREC 2012: 563-568
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-09-13 00:44 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:
