Shuji Kijima

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Eiji Takimoto

> Home > Persons > Shuji Kijima

Publications

2018
[j20]
- view
  authority control:
- export record
  dblp key:
  - journals/ieicet/FujitaHKT18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ieicet/FujitaHKT18
Takahiro Fujita, Kohei Hatano, Shuji Kijima, Eiji Takimoto:
Online Combinatorial Optimization with Multiple Projections and Its Application to Scheduling Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1334-1343 (2018)
2015
[c26]
- view
  authority control:
- export record
  dblp key:
  - conf/alt/FujitaHKT15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/alt/FujitaHKT15
Takahiro Fujita, Kohei Hatano, Shuji Kijima, Eiji Takimoto:
Online Linear Optimization for Job Scheduling Under Precedence Constraints. ALT 2015: 332-346
2012
[c18]
- view
  authority control:
- export record
  dblp key:
  - conf/alt/SuehiroHKTN12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/alt/SuehiroHKTN12
Daiki Suehiro, Kohei Hatano, Shuji Kijima, Eiji Takimoto, Kiyohito Nagano:
Online Prediction under Submodular Constraints. ALT 2012: 260-274
2011
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/isaac/YasutakeHKTT11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/YasutakeHKTT11
Shota Yasutake, Kohei Hatano, Shuji Kijima, Eiji Takimoto, Masayuki Takeda:
Online Linear Optimization over Permutations. ISAAC 2011: 534-543

a service of

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.