咨询与建议

限定检索结果

文献类型

  • 83 篇 期刊文献
  • 63 篇 会议
  • 1 册 图书

馆藏范围

  • 147 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 122 篇 理学
    • 115 篇 数学
    • 9 篇 物理学
    • 7 篇 统计学(可授理学、...
    • 5 篇 系统科学
    • 2 篇 化学
    • 2 篇 生物学
    • 1 篇 地球物理学
  • 66 篇 工学
    • 42 篇 计算机科学与技术...
    • 26 篇 软件工程
    • 12 篇 土木工程
    • 11 篇 建筑学
    • 5 篇 机械工程
    • 5 篇 材料科学与工程(可...
    • 4 篇 光学工程
    • 4 篇 测绘科学与技术
    • 3 篇 信息与通信工程
    • 3 篇 控制科学与工程
    • 3 篇 林业工程
    • 2 篇 仪器科学与技术
    • 2 篇 电气工程
    • 2 篇 电子科学与技术(可...
    • 2 篇 化学工程与技术
    • 2 篇 农业工程
    • 1 篇 力学(可授工学、理...
  • 13 篇 管理学
    • 9 篇 管理科学与工程(可...
    • 9 篇 工商管理
    • 5 篇 图书情报与档案管...
  • 4 篇 农学
    • 4 篇 作物学
  • 3 篇 经济学
    • 3 篇 应用经济学
  • 3 篇 法学
    • 3 篇 社会学
  • 1 篇 医学

主题

  • 9 篇 approximation al...
  • 9 篇 graphic methods
  • 9 篇 graph theory
  • 8 篇 polynomial appro...
  • 7 篇 trees (mathemati...
  • 6 篇 hamiltonians
  • 6 篇 directed graphs
  • 5 篇 parameterization
  • 4 篇 integer programm...
  • 4 篇 dynamic programm...
  • 4 篇 parameter estima...
  • 4 篇 color
  • 3 篇 computational co...
  • 3 篇 computational ge...
  • 3 篇 visualization
  • 3 篇 evolutionary alg...
  • 2 篇 traveling salesm...
  • 2 篇 routing
  • 2 篇 optimization
  • 2 篇 dominating set

机构

  • 54 篇 algorithms and c...
  • 18 篇 hamburg universi...
  • 11 篇 department of in...
  • 9 篇 indian institute...
  • 8 篇 hamburg universi...
  • 5 篇 algorithms and c...
  • 5 篇 cispa helmholtz ...
  • 4 篇 department of al...
  • 4 篇 institute of inf...
  • 4 篇 institute of mat...
  • 4 篇 tu hamburg insti...
  • 4 篇 st. petersburg d...
  • 3 篇 algorithms and c...
  • 3 篇 institute of the...
  • 3 篇 jetbrains resear...
  • 3 篇 university of be...
  • 2 篇 school of comput...
  • 2 篇 algorithms and c...
  • 2 篇 department of ma...
  • 2 篇 department of ma...

作者

  • 27 篇 mnich matthias
  • 21 篇 bhore sujoy
  • 20 篇 nöllenburg marti...
  • 15 篇 ganian robert
  • 9 篇 simonov kirill
  • 9 篇 saurabh saket
  • 8 篇 ramanujan m.s.
  • 7 篇 eiben eduard
  • 7 篇 li guangping
  • 6 篇 kaul matthias
  • 6 篇 golovach petr a.
  • 6 篇 rutter ignaz
  • 6 篇 sagunov danil
  • 6 篇 fomin fedor v.
  • 5 篇 löffler maarten
  • 5 篇 lokshtanov danie...
  • 4 篇 neumann frank
  • 4 篇 cembrano javier
  • 4 篇 göke alexander
  • 4 篇 hermelin danny

语言

  • 143 篇 英文
  • 4 篇 其他
检索条件"机构=Institute of Algorithms and Complexity"
147 条 记 录,以下是131-140 订阅
排序:
Proportionality in Multiple Dimensions to Design Electoral Systems
arXiv
收藏 引用
arXiv 2024年
作者: Cembrano, Javier Correa, José Díaz, Gonzalo Verdugo, Victor Department of Algorithms and Complexity Max Planck Institute for Informatics Germany Department of Industrial Engineering Universidad de Chile Chile SC Johnson Graduate School of Management Cornell University United States Institute for Mathematical and Computational Engineering PUC Chile Chile Department of Industrial and Systems Engineering School of Engineering PUC Chile Chile
How to elect the representatives in legislative bodies is a question that every modern democracy has to answer. This design task has to consider various elements so as to fulfill the citizens’ expectations and contri... 详细信息
来源: 评论
A best possible result for the square of a 2-block to be hamiltonian
arXiv
收藏 引用
arXiv 2019年
作者: Ekstein, Jan Fleischner, Herbert Department of Mathematics and European Centre of Excellence NTIS - New Technologies for the Information Society Faculty of Applied Sciences University of West Bohemia Pilsen Technická 8 Plzeň306 14 Institute of Logic and Computation Algorithms and Complexity Group Technical University of Vienna Favoritenstrasse 9-11 Wien1040 Austria
It is shown that for any choice of four different vertices x1,...,x4 in a 2-block G of order p > 3, there is a hamiltonian cycle in G2 containing four different edges xiyi of E(G) for certain vertices yi, i = 1,2,3... 详细信息
来源: 评论
Graphs with at most two moplexes
arXiv
收藏 引用
arXiv 2021年
作者: Dallard, Clément Ganian, Robert Hatzel, Meike Krnc, Matjaž Milanič, Martin Lifo Ea 4022 Insa Centre Val de Loire Université d'Orléans Orléans France Algorithms and Complexity Group Tu Wien Vienna Austria National Institute of Informatics Tokyo Japan Famnit University of Primorska Koper Slovenia Famnit Iam University of Primorska Koper Slovenia
A moplex is a natural graph structure that arises when lifting Dirac's classical theorem from chordal graphs to general graphs. The notion is known to be closely related to lexicographic searches in graphs as well... 详细信息
来源: 评论
The most general structure of graphs with hamiltonian or hamiltonian connected square
arXiv
收藏 引用
arXiv 2022年
作者: Ekstein, Jan Fleischner, Herbert Department of Mathematics European Centre of Excellence Ntis - New Technologies for the Information Society Faculty of Applied Sciences University of West Bohemia Pilsen Technická 8 Plzeň306 14 Czech Republic Institute of Logic and Computation Algorithms and Complexity Group Technical University of Vienna Favoritenstrasse 9 - 11 Wien1040 Austria
On the basis of recent results on hamiltonicity, [4], and hamiltonian connectedness, [8], in the square of a 2-block, we determine the most general block-cutvertex structure a graph G may have in order to guarantee th... 详细信息
来源: 评论
Untangling Circular Drawings: algorithms and complexity
arXiv
收藏 引用
arXiv 2021年
作者: Bhore, Sujoy Li, Guangping Nöllenburg, Martin Rutter, Ignaz Wu, Hsiang-Yun Indian Institute of Science Education and Research Bhopal India Algorithms and Complexity Group TU Wien Vienna Austria University of Passau Passau Germany Research Unit of Computer Graphics TU Wien Vienna Austria St. Pölten University of Applied Sciences St. Pölten Austria
We consider the problem of untangling a given (non-planar) straight-line circular drawing δG of an outerplanar graph G = (V, E) into a planar straight-line circular drawing by shifting a minimum number of vertices to... 详细信息
来源: 评论
Integer programming and incidence treedepth
arXiv
收藏 引用
arXiv 2020年
作者: Eiben, Eduard Ganian, Robert Knop, Dušan Ordyniak, Sebastian Pilipczuk, Michal Wrochna, Marcin Department of Computer Science Royal Holloway University of London United Kingdom Algorithms and Complexity Group Vienna University of Technology Austria Department of Theoretical Computer Science Czech Technical University in Prague Czech Republic School of Computing University of Leeds United Kingdom Institute of Informatics University of Warsaw Poland University of Oxford United Kingdom
Recently a strong connection has been shown between the tractability of integer programming (IP) with bounded coefficients on the one side and the structure of its constraint matrix on the other side. To that end, int... 详细信息
来源: 评论
Revisiting the hamiltonian theme in the square of a block: The general case
arXiv
收藏 引用
arXiv 2018年
作者: Fleischner, Herbert Chia, Gek L. Institute of Logic and Computation Algorithms and Complexity Group Technical University of Vienna Austria Department of Mathematical and Actuarial Sciences Lee Kong Chian Faculty of Engineering and Science Universiti Tunku Abdul Rahman Sungai Long Campus Jalan Sungai Long Bandar Sungai Long Cheras KajangSelangor43000 Malaysia Institute of Mathematical Sciences University of Malaya Kuala Lumpur50603 Malaysia
This is the second part of joint research in which we show that every 2-connected graph G has the F4 property. That is, given distinct xi ∈ V (G), 1 ≤ i ≤ 4, there is an x1x2-hamiltonian path in G2 containing diffe... 详细信息
来源: 评论
Geometric systems of unbiased representatives
arXiv
收藏 引用
arXiv 2020年
作者: Banik, Aritra Bhattacharya, Bhaswar B. Bhore, Sujoy Martínez-Sandoval, Leonardo School of Computer Sciences National Institute of Science Education and Research HBNI Bhubaneswar India Department of Statistics University of Pennsylvania Philadelphia United States Algorithms and Complexity Group Technische Universität Wien Austria Institut de Mathématiques de Jussieu-Paris Rive Gauche UMR 7586 Sorbonne Université France
Let P be a set of points in Rd, B a bicoloring of P and O a family of geometric objects (that is, intervals, boxes, balls, etc). An object from O is called balanced with respect to B if it contains the same number of ...
来源: 评论
Envy-free dynamic pricing schemes
arXiv
收藏 引用
arXiv 2023年
作者: Bérczi, Kristóf Codazzi, Laura Golak, Julian Grigoriev, Alexander MTA-ELTE Momentum Matroid Optimization Research Group MTA-ELTE Egerváry Research Group Department of Operations Research Eötvös Loránd University Budapest Hungary Institute of Algorithms and Complexity Hamburg University of Technology Hamburg Germany Department of Data Analytics and Digitalisation Maastricht University Maastricht Netherlands
A combinatorial market consists of a set of indivisible items and a set of agents, where each agent has a valuation function that specifies for each subset of items its value for the given agent. From an optimization ... 详细信息
来源: 评论
A unifying framework for characterizing and computing width measures
arXiv
收藏 引用
arXiv 2021年
作者: Eiben, Eduard Ganian, Robert Hamm, Thekla Jaffke, Lars Kwon, O-Joung Department of Computer Science Royal Holloway University of London Egham United Kingdom Algorithms and Complexity Group TU Wien Vienna Austria Department of Informatics University of Bergen Bergen Norway Department of Mathematics Incheon National University Incheon Korea Republic of Discrete Mathematics Group Institute for Basic Science Daejeon Korea Republic of
algorithms for computing or approximating optimal decompositions for decompositional parameters such as treewidth or clique-width have so far traditionally been tailored to specific width parameters. Moreover, for mim... 详细信息
来源: 评论